java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec27_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:52:32,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:52:32,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:52:33,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:52:33,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:52:33,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:52:33,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:52:33,010 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:52:33,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:52:33,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:52:33,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:52:33,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:52:33,015 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:52:33,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:52:33,017 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:52:33,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:52:33,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:52:33,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:52:33,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:52:33,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:52:33,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:52:33,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:52:33,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:52:33,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:52:33,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:52:33,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:52:33,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:52:33,031 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:52:33,032 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:52:33,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:52:33,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:52:33,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:52:33,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:52:33,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:52:33,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:52:33,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:52:33,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:52:33,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:52:33,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:52:33,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:52:33,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:52:33,045 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:52:33,068 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:52:33,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:52:33,070 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:52:33,070 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:52:33,071 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:52:33,071 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:52:33,071 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:52:33,071 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:52:33,072 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:52:33,072 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:52:33,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:52:33,074 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:52:33,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:52:33,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:52:33,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:52:33,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:52:33,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:52:33,076 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:52:33,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:52:33,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:52:33,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:52:33,077 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:52:33,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:52:33,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:52:33,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:52:33,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:52:33,078 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:52:33,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:52:33,078 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:52:33,078 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:52:33,127 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:52:33,141 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:52:33,144 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:52:33,146 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:52:33,146 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:52:33,147 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec27_productSimulator.cil.c [2019-10-03 02:52:33,211 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d59a99330/ff11ed50603d47bba1fe56ee8f020969/FLAG6f020ebe4 [2019-10-03 02:52:33,844 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:52:33,845 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec27_productSimulator.cil.c [2019-10-03 02:52:33,874 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d59a99330/ff11ed50603d47bba1fe56ee8f020969/FLAG6f020ebe4 [2019-10-03 02:52:34,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d59a99330/ff11ed50603d47bba1fe56ee8f020969 [2019-10-03 02:52:34,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:52:34,052 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:52:34,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:52:34,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:52:34,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:52:34,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:52:34" (1/1) ... [2019-10-03 02:52:34,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18ad9034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:34, skipping insertion in model container [2019-10-03 02:52:34,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:52:34" (1/1) ... [2019-10-03 02:52:34,070 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:52:34,177 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:52:35,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:52:35,101 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:52:35,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:52:35,422 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:52:35,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:35 WrapperNode [2019-10-03 02:52:35,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:52:35,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:52:35,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:52:35,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:52:35,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:35" (1/1) ... [2019-10-03 02:52:35,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:35" (1/1) ... [2019-10-03 02:52:35,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:35" (1/1) ... [2019-10-03 02:52:35,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:35" (1/1) ... [2019-10-03 02:52:35,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:35" (1/1) ... [2019-10-03 02:52:35,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:35" (1/1) ... [2019-10-03 02:52:35,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:35" (1/1) ... [2019-10-03 02:52:35,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:52:35,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:52:35,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:52:35,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:52:35,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:35" (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-10-03 02:52:35,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:52:35,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:52:35,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:52:35,774 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:52:35,774 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:52:35,774 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:52:35,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:52:35,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:52:35,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:52:35,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:52:35,776 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:52:35,776 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:52:35,777 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:52:35,778 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:52:35,778 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:52:35,779 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:52:35,779 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:52:35,779 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:52:35,780 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:52:35,780 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:52:35,780 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:52:35,781 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:52:35,781 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:52:35,781 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:52:35,782 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:52:35,782 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:52:35,783 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:52:35,783 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:52:35,783 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:52:35,783 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:52:35,783 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:52:35,784 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:52:35,784 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:52:35,784 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:52:35,784 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:52:35,784 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:52:35,785 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:52:35,785 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:52:35,785 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:52:35,785 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:52:35,785 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:52:35,785 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:52:35,786 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:52:35,786 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:52:35,786 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:52:35,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__VerifyForward_spec__1 [2019-10-03 02:52:35,787 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:52:35,787 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:52:35,787 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:52:35,787 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:52:35,787 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:52:35,788 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:52:35,788 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:52:35,788 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:52:35,788 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:52:35,788 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:52:35,789 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:52:35,789 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:52:35,789 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:52:35,790 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:52:35,790 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:52:35,791 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:52:35,791 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:52:35,791 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:52:35,791 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:52:35,792 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:52:35,792 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:52:35,792 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:52:35,792 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2019-10-03 02:52:35,792 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Encrypt [2019-10-03 02:52:35,792 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2019-10-03 02:52:35,793 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__AddressBook [2019-10-03 02:52:35,793 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2019-10-03 02:52:35,794 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Sign [2019-10-03 02:52:35,794 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:52:35,794 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:52:35,794 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2019-10-03 02:52:35,794 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__AutoResponder [2019-10-03 02:52:35,794 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2019-10-03 02:52:35,795 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Forward [2019-10-03 02:52:35,795 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2019-10-03 02:52:35,796 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Verify [2019-10-03 02:52:35,796 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2019-10-03 02:52:35,796 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Decrypt [2019-10-03 02:52:35,796 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:52:35,798 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:52:35,802 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:52:35,803 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:52:35,803 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:52:35,803 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:52:35,804 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:52:35,804 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:52:35,804 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:52:35,804 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-03 02:52:35,805 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-03 02:52:35,805 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-03 02:52:35,806 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-03 02:52:35,806 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-03 02:52:35,806 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2019-10-03 02:52:35,806 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__role__Keys [2019-10-03 02:52:35,807 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:52:35,807 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2019-10-03 02:52:35,807 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__role__Keys [2019-10-03 02:52:35,808 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:52:35,808 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2019-10-03 02:52:35,809 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__role__Keys [2019-10-03 02:52:35,809 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:52:35,810 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:52:35,810 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:52:35,811 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:52:35,811 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:52:35,811 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:52:35,811 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:52:35,811 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:52:35,812 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:52:35,812 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:52:35,813 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:52:35,814 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:52:35,814 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:52:35,815 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:52:35,815 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-03 02:52:35,815 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-03 02:52:35,815 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-03 02:52:35,818 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2019-10-03 02:52:35,818 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Encrypt [2019-10-03 02:52:35,818 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2019-10-03 02:52:35,818 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Sign [2019-10-03 02:52:35,819 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2019-10-03 02:52:35,819 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Verify [2019-10-03 02:52:35,819 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:52:35,824 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2019-10-03 02:52:35,825 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__role__Encrypt [2019-10-03 02:52:35,825 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:52:35,825 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:52:35,825 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:52:35,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:52:35,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:52:35,826 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:52:35,827 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:52:35,830 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:52:35,831 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:52:35,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:52:35,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:52:35,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:52:35,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:52:35,839 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:52:35,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:52:35,839 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:52:35,839 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:52:35,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:52:35,840 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:52:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:52:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:52:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:52:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:52:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:52:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:52:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:52:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:52:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:52:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:52:35,843 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:52:35,843 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:52:35,843 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:52:35,843 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:52:35,843 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:52:35,843 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:52:35,844 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:52:35,844 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:52:35,844 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:52:35,844 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:52:35,844 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:52:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:52:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:52:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:52:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:52:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:52:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:52:35,846 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:52:35,846 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:52:35,846 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:52:35,846 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:52:35,846 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:52:35,846 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:52:35,846 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:52:35,847 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:52:35,847 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:52:35,847 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:52:35,847 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:52:35,847 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:52:35,847 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:52:35,848 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-03 02:52:35,848 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:52:35,848 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:52:35,848 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:52:35,848 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-03 02:52:35,848 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:52:35,849 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-03 02:52:35,849 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:52:35,849 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:52:35,849 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:52:35,849 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:52:35,849 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:52:35,850 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:52:35,850 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:52:35,850 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__VerifyForward_spec__1 [2019-10-03 02:52:35,850 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:52:35,850 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:52:35,850 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:52:35,851 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:52:35,851 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:52:35,851 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:52:35,851 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:52:35,851 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:52:35,851 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:52:35,851 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:52:35,852 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:52:35,852 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:52:35,852 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:52:35,852 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:52:35,852 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:52:35,853 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:52:35,853 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:52:35,853 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:52:35,853 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:52:35,853 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:52:35,853 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:52:35,853 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:52:35,854 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:52:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:52:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:52:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:52:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:52:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:52:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:52:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:52:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:52:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:52:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:52:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:52:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-03 02:52:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-03 02:52:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-03 02:52:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-03 02:52:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-03 02:52:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2019-10-03 02:52:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Encrypt [2019-10-03 02:52:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2019-10-03 02:52:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__AddressBook [2019-10-03 02:52:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2019-10-03 02:52:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Sign [2019-10-03 02:52:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2019-10-03 02:52:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__AutoResponder [2019-10-03 02:52:35,881 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2019-10-03 02:52:35,881 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Forward [2019-10-03 02:52:35,881 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2019-10-03 02:52:35,881 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Verify [2019-10-03 02:52:35,881 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2019-10-03 02:52:35,881 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Decrypt [2019-10-03 02:52:35,881 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:52:35,881 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:52:35,881 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:52:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:52:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:52:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:52:35,883 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:52:35,886 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:52:35,886 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2019-10-03 02:52:35,886 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__role__Keys [2019-10-03 02:52:35,886 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2019-10-03 02:52:35,887 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__role__Keys [2019-10-03 02:52:35,887 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2019-10-03 02:52:35,887 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__role__Keys [2019-10-03 02:52:35,887 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:52:35,889 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2019-10-03 02:52:35,889 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Encrypt [2019-10-03 02:52:35,889 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2019-10-03 02:52:35,889 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Sign [2019-10-03 02:52:35,890 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2019-10-03 02:52:35,890 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Verify [2019-10-03 02:52:35,890 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2019-10-03 02:52:35,890 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__role__Encrypt [2019-10-03 02:52:35,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:52:35,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:52:35,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:52:38,256 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:52:38,256 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:52:38,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:52:38 BoogieIcfgContainer [2019-10-03 02:52:38,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:52:38,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:52:38,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:52:38,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:52:38,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:52:34" (1/3) ... [2019-10-03 02:52:38,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ebbbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:52:38, skipping insertion in model container [2019-10-03 02:52:38,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:35" (2/3) ... [2019-10-03 02:52:38,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ebbbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:52:38, skipping insertion in model container [2019-10-03 02:52:38,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:52:38" (3/3) ... [2019-10-03 02:52:38,269 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec27_productSimulator.cil.c [2019-10-03 02:52:38,280 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:52:38,296 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:52:38,318 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:52:38,353 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:52:38,354 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:52:38,354 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:52:38,354 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:52:38,354 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:52:38,354 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:52:38,354 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:52:38,355 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:52:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states. [2019-10-03 02:52:38,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-03 02:52:38,446 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:38,448 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:52:38,451 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:38,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:38,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1302396452, now seen corresponding path program 1 times [2019-10-03 02:52:38,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:38,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:38,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:38,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:38,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:39,275 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-03 02:52:39,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:39,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:52:39,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:39,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:52:39,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:52:39,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:52:39,304 INFO L87 Difference]: Start difference. First operand 816 states. Second operand 6 states. [2019-10-03 02:52:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:39,481 INFO L93 Difference]: Finished difference Result 804 states and 1098 transitions. [2019-10-03 02:52:39,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:52:39,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 205 [2019-10-03 02:52:39,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:39,520 INFO L225 Difference]: With dead ends: 804 [2019-10-03 02:52:39,520 INFO L226 Difference]: Without dead ends: 787 [2019-10-03 02:52:39,524 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:52:39,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-10-03 02:52:39,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 787. [2019-10-03 02:52:39,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2019-10-03 02:52:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1072 transitions. [2019-10-03 02:52:39,645 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1072 transitions. Word has length 205 [2019-10-03 02:52:39,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:39,647 INFO L475 AbstractCegarLoop]: Abstraction has 787 states and 1072 transitions. [2019-10-03 02:52:39,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:52:39,647 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1072 transitions. [2019-10-03 02:52:39,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-03 02:52:39,655 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:39,655 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:52:39,655 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:39,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:39,656 INFO L82 PathProgramCache]: Analyzing trace with hash 988197411, now seen corresponding path program 1 times [2019-10-03 02:52:39,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:39,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:39,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:39,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:39,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-03 02:52:40,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:40,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:52:40,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:40,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:52:40,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:52:40,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:52:40,032 INFO L87 Difference]: Start difference. First operand 787 states and 1072 transitions. Second operand 4 states. [2019-10-03 02:52:40,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:40,924 INFO L93 Difference]: Finished difference Result 788 states and 1067 transitions. [2019-10-03 02:52:40,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:52:40,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-10-03 02:52:40,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:40,935 INFO L225 Difference]: With dead ends: 788 [2019-10-03 02:52:40,936 INFO L226 Difference]: Without dead ends: 788 [2019-10-03 02:52:40,937 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:52:40,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-10-03 02:52:40,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2019-10-03 02:52:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-10-03 02:52:40,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1067 transitions. [2019-10-03 02:52:40,999 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1067 transitions. Word has length 211 [2019-10-03 02:52:41,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:41,000 INFO L475 AbstractCegarLoop]: Abstraction has 788 states and 1067 transitions. [2019-10-03 02:52:41,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:52:41,000 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1067 transitions. [2019-10-03 02:52:41,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-03 02:52:41,006 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:41,007 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:52:41,007 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:41,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:41,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1021601412, now seen corresponding path program 1 times [2019-10-03 02:52:41,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:41,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:41,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:41,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:41,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-03 02:52:41,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:41,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:52:41,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:41,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:52:41,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:52:41,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:52:41,299 INFO L87 Difference]: Start difference. First operand 788 states and 1067 transitions. Second operand 3 states. [2019-10-03 02:52:41,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:41,375 INFO L93 Difference]: Finished difference Result 1499 states and 2053 transitions. [2019-10-03 02:52:41,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:52:41,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-10-03 02:52:41,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:41,387 INFO L225 Difference]: With dead ends: 1499 [2019-10-03 02:52:41,387 INFO L226 Difference]: Without dead ends: 1497 [2019-10-03 02:52:41,387 INFO L640 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-10-03 02:52:41,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2019-10-03 02:52:41,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1494. [2019-10-03 02:52:41,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2019-10-03 02:52:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 2049 transitions. [2019-10-03 02:52:41,452 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 2049 transitions. Word has length 230 [2019-10-03 02:52:41,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:41,452 INFO L475 AbstractCegarLoop]: Abstraction has 1494 states and 2049 transitions. [2019-10-03 02:52:41,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:52:41,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 2049 transitions. [2019-10-03 02:52:41,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-03 02:52:41,465 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:41,465 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:52:41,465 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:41,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:41,466 INFO L82 PathProgramCache]: Analyzing trace with hash 83138754, now seen corresponding path program 1 times [2019-10-03 02:52:41,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:41,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:41,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:41,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:41,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:41,639 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-03 02:52:41,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:41,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:52:41,640 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:41,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:52:41,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:52:41,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:52:41,641 INFO L87 Difference]: Start difference. First operand 1494 states and 2049 transitions. Second operand 3 states. [2019-10-03 02:52:41,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:41,795 INFO L93 Difference]: Finished difference Result 789 states and 1061 transitions. [2019-10-03 02:52:41,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:52:41,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-10-03 02:52:41,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:41,804 INFO L225 Difference]: With dead ends: 789 [2019-10-03 02:52:41,804 INFO L226 Difference]: Without dead ends: 789 [2019-10-03 02:52:41,806 INFO L640 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-10-03 02:52:41,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-10-03 02:52:41,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2019-10-03 02:52:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-10-03 02:52:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1061 transitions. [2019-10-03 02:52:41,840 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1061 transitions. Word has length 231 [2019-10-03 02:52:41,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:41,842 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1061 transitions. [2019-10-03 02:52:41,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:52:41,843 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1061 transitions. [2019-10-03 02:52:41,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-03 02:52:41,848 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:41,849 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:52:41,849 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:41,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:41,849 INFO L82 PathProgramCache]: Analyzing trace with hash -575856261, now seen corresponding path program 1 times [2019-10-03 02:52:41,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:41,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:41,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:41,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:41,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:42,252 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-03 02:52:42,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:42,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:52:42,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:42,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:52:42,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:52:42,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:52:42,257 INFO L87 Difference]: Start difference. First operand 789 states and 1061 transitions. Second operand 4 states. [2019-10-03 02:52:43,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:43,063 INFO L93 Difference]: Finished difference Result 795 states and 1052 transitions. [2019-10-03 02:52:43,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:52:43,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2019-10-03 02:52:43,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:43,071 INFO L225 Difference]: With dead ends: 795 [2019-10-03 02:52:43,071 INFO L226 Difference]: Without dead ends: 795 [2019-10-03 02:52:43,071 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:52:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-10-03 02:52:43,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 789. [2019-10-03 02:52:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-10-03 02:52:43,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1046 transitions. [2019-10-03 02:52:43,103 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1046 transitions. Word has length 245 [2019-10-03 02:52:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:43,105 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1046 transitions. [2019-10-03 02:52:43,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:52:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1046 transitions. [2019-10-03 02:52:43,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-10-03 02:52:43,117 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:43,117 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:52:43,117 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:43,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:43,118 INFO L82 PathProgramCache]: Analyzing trace with hash 218526341, now seen corresponding path program 1 times [2019-10-03 02:52:43,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:43,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:43,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:43,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:43,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-03 02:52:43,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:43,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:52:43,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:43,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:52:43,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:52:43,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:52:43,345 INFO L87 Difference]: Start difference. First operand 789 states and 1046 transitions. Second operand 3 states. [2019-10-03 02:52:43,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:43,367 INFO L93 Difference]: Finished difference Result 792 states and 1049 transitions. [2019-10-03 02:52:43,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:52:43,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2019-10-03 02:52:43,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:43,372 INFO L225 Difference]: With dead ends: 792 [2019-10-03 02:52:43,373 INFO L226 Difference]: Without dead ends: 792 [2019-10-03 02:52:43,373 INFO L640 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-10-03 02:52:43,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-10-03 02:52:43,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 791. [2019-10-03 02:52:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-10-03 02:52:43,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1048 transitions. [2019-10-03 02:52:43,400 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1048 transitions. Word has length 272 [2019-10-03 02:52:43,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:43,401 INFO L475 AbstractCegarLoop]: Abstraction has 791 states and 1048 transitions. [2019-10-03 02:52:43,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:52:43,401 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1048 transitions. [2019-10-03 02:52:43,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-03 02:52:43,412 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:43,413 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:52:43,413 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:43,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:43,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1200585663, now seen corresponding path program 1 times [2019-10-03 02:52:43,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:43,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:43,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:43,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:43,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-03 02:52:43,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:43,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:52:43,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:43,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:52:43,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:52:43,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:52:43,719 INFO L87 Difference]: Start difference. First operand 791 states and 1048 transitions. Second operand 3 states. [2019-10-03 02:52:43,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:43,750 INFO L93 Difference]: Finished difference Result 846 states and 1137 transitions. [2019-10-03 02:52:43,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:52:43,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 280 [2019-10-03 02:52:43,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:43,759 INFO L225 Difference]: With dead ends: 846 [2019-10-03 02:52:43,760 INFO L226 Difference]: Without dead ends: 846 [2019-10-03 02:52:43,760 INFO L640 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-10-03 02:52:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-10-03 02:52:43,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 845. [2019-10-03 02:52:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2019-10-03 02:52:43,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1136 transitions. [2019-10-03 02:52:43,785 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1136 transitions. Word has length 280 [2019-10-03 02:52:43,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:43,785 INFO L475 AbstractCegarLoop]: Abstraction has 845 states and 1136 transitions. [2019-10-03 02:52:43,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:52:43,786 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1136 transitions. [2019-10-03 02:52:43,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-10-03 02:52:43,792 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:43,793 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:52:43,793 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:43,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:43,793 INFO L82 PathProgramCache]: Analyzing trace with hash -398027279, now seen corresponding path program 1 times [2019-10-03 02:52:43,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:43,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:43,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:43,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:43,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-03 02:52:44,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:44,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:52:44,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:44,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:52:44,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:52:44,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:52:44,100 INFO L87 Difference]: Start difference. First operand 845 states and 1136 transitions. Second operand 9 states. [2019-10-03 02:52:44,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:44,406 INFO L93 Difference]: Finished difference Result 865 states and 1166 transitions. [2019-10-03 02:52:44,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:52:44,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 281 [2019-10-03 02:52:44,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:44,413 INFO L225 Difference]: With dead ends: 865 [2019-10-03 02:52:44,413 INFO L226 Difference]: Without dead ends: 865 [2019-10-03 02:52:44,413 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:52:44,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-10-03 02:52:44,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 849. [2019-10-03 02:52:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-10-03 02:52:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1141 transitions. [2019-10-03 02:52:44,441 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1141 transitions. Word has length 281 [2019-10-03 02:52:44,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:44,442 INFO L475 AbstractCegarLoop]: Abstraction has 849 states and 1141 transitions. [2019-10-03 02:52:44,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:52:44,442 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1141 transitions. [2019-10-03 02:52:44,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-03 02:52:44,449 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:44,449 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:52:44,450 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:44,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:44,450 INFO L82 PathProgramCache]: Analyzing trace with hash 308695699, now seen corresponding path program 1 times [2019-10-03 02:52:44,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:44,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:44,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:44,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:44,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-03 02:52:44,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:44,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:52:44,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:44,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:52:44,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:52:44,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:52:44,735 INFO L87 Difference]: Start difference. First operand 849 states and 1141 transitions. Second operand 4 states. [2019-10-03 02:52:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:46,027 INFO L93 Difference]: Finished difference Result 1612 states and 2163 transitions. [2019-10-03 02:52:46,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:52:46,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 288 [2019-10-03 02:52:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:46,037 INFO L225 Difference]: With dead ends: 1612 [2019-10-03 02:52:46,037 INFO L226 Difference]: Without dead ends: 1611 [2019-10-03 02:52:46,038 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:52:46,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2019-10-03 02:52:46,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1608. [2019-10-03 02:52:46,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1608 states. [2019-10-03 02:52:46,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2160 transitions. [2019-10-03 02:52:46,089 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2160 transitions. Word has length 288 [2019-10-03 02:52:46,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:46,090 INFO L475 AbstractCegarLoop]: Abstraction has 1608 states and 2160 transitions. [2019-10-03 02:52:46,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:52:46,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2160 transitions. [2019-10-03 02:52:46,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-03 02:52:46,100 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:46,100 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:52:46,101 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:46,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:46,101 INFO L82 PathProgramCache]: Analyzing trace with hash -803792840, now seen corresponding path program 1 times [2019-10-03 02:52:46,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:46,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:46,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:46,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:46,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-03 02:52:46,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:46,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:52:46,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:46,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:52:46,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:52:46,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:52:46,438 INFO L87 Difference]: Start difference. First operand 1608 states and 2160 transitions. Second operand 7 states. [2019-10-03 02:52:50,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:50,731 INFO L93 Difference]: Finished difference Result 2494 states and 3322 transitions. [2019-10-03 02:52:50,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:52:50,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 288 [2019-10-03 02:52:50,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:50,752 INFO L225 Difference]: With dead ends: 2494 [2019-10-03 02:52:50,753 INFO L226 Difference]: Without dead ends: 2478 [2019-10-03 02:52:50,753 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:52:50,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2019-10-03 02:52:50,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2463. [2019-10-03 02:52:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2019-10-03 02:52:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 3274 transitions. [2019-10-03 02:52:50,898 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 3274 transitions. Word has length 288 [2019-10-03 02:52:50,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:50,901 INFO L475 AbstractCegarLoop]: Abstraction has 2463 states and 3274 transitions. [2019-10-03 02:52:50,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:52:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 3274 transitions. [2019-10-03 02:52:50,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-10-03 02:52:50,916 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:50,916 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:52:50,917 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:50,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:50,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1576359952, now seen corresponding path program 1 times [2019-10-03 02:52:50,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:50,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:50,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:50,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:50,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:52,216 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-03 02:52:52,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:52,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-10-03 02:52:52,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:52,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-03 02:52:52,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-03 02:52:52,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-10-03 02:52:52,219 INFO L87 Difference]: Start difference. First operand 2463 states and 3274 transitions. Second operand 36 states. [2019-10-03 02:52:53,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:53,589 INFO L93 Difference]: Finished difference Result 2629 states and 3472 transitions. [2019-10-03 02:52:53,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-03 02:52:53,590 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 289 [2019-10-03 02:52:53,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:53,607 INFO L225 Difference]: With dead ends: 2629 [2019-10-03 02:52:53,607 INFO L226 Difference]: Without dead ends: 2605 [2019-10-03 02:52:53,609 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=133, Invalid=2519, Unknown=0, NotChecked=0, Total=2652 [2019-10-03 02:52:53,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2019-10-03 02:52:53,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 2600. [2019-10-03 02:52:53,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2600 states. [2019-10-03 02:52:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 3437 transitions. [2019-10-03 02:52:53,691 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 3437 transitions. Word has length 289 [2019-10-03 02:52:53,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:53,692 INFO L475 AbstractCegarLoop]: Abstraction has 2600 states and 3437 transitions. [2019-10-03 02:52:53,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-03 02:52:53,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 3437 transitions. [2019-10-03 02:52:53,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-03 02:52:53,700 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:53,700 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:52:53,700 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:53,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:53,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1491044311, now seen corresponding path program 1 times [2019-10-03 02:52:53,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:53,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:53,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:53,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:53,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-03 02:52:53,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:53,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:52:53,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:53,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:52:53,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:52:53,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:52:53,990 INFO L87 Difference]: Start difference. First operand 2600 states and 3437 transitions. Second operand 3 states. [2019-10-03 02:52:54,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:54,053 INFO L93 Difference]: Finished difference Result 3734 states and 4961 transitions. [2019-10-03 02:52:54,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:52:54,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-10-03 02:52:54,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:54,077 INFO L225 Difference]: With dead ends: 3734 [2019-10-03 02:52:54,077 INFO L226 Difference]: Without dead ends: 3734 [2019-10-03 02:52:54,077 INFO L640 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-10-03 02:52:54,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states. [2019-10-03 02:52:54,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 3731. [2019-10-03 02:52:54,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3731 states. [2019-10-03 02:52:54,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 4959 transitions. [2019-10-03 02:52:54,198 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 4959 transitions. Word has length 298 [2019-10-03 02:52:54,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:54,199 INFO L475 AbstractCegarLoop]: Abstraction has 3731 states and 4959 transitions. [2019-10-03 02:52:54,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:52:54,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 4959 transitions. [2019-10-03 02:52:54,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-03 02:52:54,207 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:54,207 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:52:54,208 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:54,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:54,208 INFO L82 PathProgramCache]: Analyzing trace with hash 698994677, now seen corresponding path program 1 times [2019-10-03 02:52:54,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:54,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:54,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:54,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:54,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:55,083 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-03 02:52:55,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:55,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2019-10-03 02:52:55,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:55,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-03 02:52:55,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-03 02:52:55,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-10-03 02:52:55,086 INFO L87 Difference]: Start difference. First operand 3731 states and 4959 transitions. Second operand 38 states. [2019-10-03 02:52:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:56,656 INFO L93 Difference]: Finished difference Result 3977 states and 5298 transitions. [2019-10-03 02:52:56,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-03 02:52:56,657 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 298 [2019-10-03 02:52:56,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:56,681 INFO L225 Difference]: With dead ends: 3977 [2019-10-03 02:52:56,681 INFO L226 Difference]: Without dead ends: 3965 [2019-10-03 02:52:56,682 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=2829, Unknown=0, NotChecked=0, Total=2970 [2019-10-03 02:52:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2019-10-03 02:52:56,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3944. [2019-10-03 02:52:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3944 states. [2019-10-03 02:52:56,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 5237 transitions. [2019-10-03 02:52:56,813 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 5237 transitions. Word has length 298 [2019-10-03 02:52:56,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:56,814 INFO L475 AbstractCegarLoop]: Abstraction has 3944 states and 5237 transitions. [2019-10-03 02:52:56,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-03 02:52:56,814 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 5237 transitions. [2019-10-03 02:52:56,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-03 02:52:56,824 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:56,825 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:52:56,825 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:56,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:56,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1199145277, now seen corresponding path program 1 times [2019-10-03 02:52:56,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:56,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:56,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:56,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:56,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-03 02:52:57,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:57,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2019-10-03 02:52:57,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:57,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-03 02:52:57,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-03 02:52:57,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-10-03 02:52:57,935 INFO L87 Difference]: Start difference. First operand 3944 states and 5237 transitions. Second operand 40 states. [2019-10-03 02:52:59,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:59,704 INFO L93 Difference]: Finished difference Result 4018 states and 5331 transitions. [2019-10-03 02:52:59,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-03 02:52:59,706 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 300 [2019-10-03 02:52:59,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:59,730 INFO L225 Difference]: With dead ends: 4018 [2019-10-03 02:52:59,730 INFO L226 Difference]: Without dead ends: 4018 [2019-10-03 02:52:59,731 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=149, Invalid=3157, Unknown=0, NotChecked=0, Total=3306 [2019-10-03 02:52:59,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4018 states. [2019-10-03 02:52:59,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4018 to 4009. [2019-10-03 02:52:59,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4009 states. [2019-10-03 02:52:59,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4009 states to 4009 states and 5318 transitions. [2019-10-03 02:52:59,835 INFO L78 Accepts]: Start accepts. Automaton has 4009 states and 5318 transitions. Word has length 300 [2019-10-03 02:52:59,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:59,836 INFO L475 AbstractCegarLoop]: Abstraction has 4009 states and 5318 transitions. [2019-10-03 02:52:59,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-03 02:52:59,837 INFO L276 IsEmpty]: Start isEmpty. Operand 4009 states and 5318 transitions. [2019-10-03 02:52:59,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-03 02:52:59,846 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:59,847 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:52:59,847 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:59,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:59,848 INFO L82 PathProgramCache]: Analyzing trace with hash 249683652, now seen corresponding path program 1 times [2019-10-03 02:52:59,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:59,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:59,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:59,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:59,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-03 02:53:00,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:00,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:53:00,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:00,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:53:00,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:53:00,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:53:00,178 INFO L87 Difference]: Start difference. First operand 4009 states and 5318 transitions. Second operand 3 states. [2019-10-03 02:53:00,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:00,268 INFO L93 Difference]: Finished difference Result 7455 states and 10209 transitions. [2019-10-03 02:53:00,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:53:00,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-10-03 02:53:00,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:00,330 INFO L225 Difference]: With dead ends: 7455 [2019-10-03 02:53:00,330 INFO L226 Difference]: Without dead ends: 7455 [2019-10-03 02:53:00,333 INFO L640 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-10-03 02:53:00,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7455 states. [2019-10-03 02:53:00,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7455 to 7448. [2019-10-03 02:53:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7448 states. [2019-10-03 02:53:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7448 states to 7448 states and 10201 transitions. [2019-10-03 02:53:00,565 INFO L78 Accepts]: Start accepts. Automaton has 7448 states and 10201 transitions. Word has length 300 [2019-10-03 02:53:00,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:00,566 INFO L475 AbstractCegarLoop]: Abstraction has 7448 states and 10201 transitions. [2019-10-03 02:53:00,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:53:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 7448 states and 10201 transitions. [2019-10-03 02:53:00,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-10-03 02:53:00,580 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:00,581 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:53:00,581 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:00,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:00,581 INFO L82 PathProgramCache]: Analyzing trace with hash 637453276, now seen corresponding path program 1 times [2019-10-03 02:53:00,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:00,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:00,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:00,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:00,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:00,771 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-03 02:53:00,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:00,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:53:00,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:00,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:53:00,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:53:00,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:53:00,775 INFO L87 Difference]: Start difference. First operand 7448 states and 10201 transitions. Second operand 3 states. [2019-10-03 02:53:00,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:00,816 INFO L93 Difference]: Finished difference Result 8078 states and 11209 transitions. [2019-10-03 02:53:00,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:53:00,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-10-03 02:53:00,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:00,860 INFO L225 Difference]: With dead ends: 8078 [2019-10-03 02:53:00,861 INFO L226 Difference]: Without dead ends: 8078 [2019-10-03 02:53:00,861 INFO L640 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-10-03 02:53:00,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8078 states. [2019-10-03 02:53:01,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8078 to 8072. [2019-10-03 02:53:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-10-03 02:53:01,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 11203 transitions. [2019-10-03 02:53:01,067 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 11203 transitions. Word has length 304 [2019-10-03 02:53:01,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:01,067 INFO L475 AbstractCegarLoop]: Abstraction has 8072 states and 11203 transitions. [2019-10-03 02:53:01,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:53:01,067 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 11203 transitions. [2019-10-03 02:53:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-10-03 02:53:01,087 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:01,087 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:53:01,088 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:01,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:01,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1828229839, now seen corresponding path program 1 times [2019-10-03 02:53:01,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:01,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:01,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:01,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:01,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-03 02:53:01,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:01,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:53:01,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:01,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:53:01,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:53:01,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:53:01,254 INFO L87 Difference]: Start difference. First operand 8072 states and 11203 transitions. Second operand 3 states. [2019-10-03 02:53:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:01,303 INFO L93 Difference]: Finished difference Result 9272 states and 13123 transitions. [2019-10-03 02:53:01,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:53:01,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2019-10-03 02:53:01,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:01,334 INFO L225 Difference]: With dead ends: 9272 [2019-10-03 02:53:01,335 INFO L226 Difference]: Without dead ends: 9272 [2019-10-03 02:53:01,335 INFO L640 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-10-03 02:53:01,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9272 states. [2019-10-03 02:53:01,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9272 to 9266. [2019-10-03 02:53:01,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9266 states. [2019-10-03 02:53:01,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9266 states to 9266 states and 13117 transitions. [2019-10-03 02:53:01,566 INFO L78 Accepts]: Start accepts. Automaton has 9266 states and 13117 transitions. Word has length 296 [2019-10-03 02:53:01,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:01,567 INFO L475 AbstractCegarLoop]: Abstraction has 9266 states and 13117 transitions. [2019-10-03 02:53:01,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:53:01,567 INFO L276 IsEmpty]: Start isEmpty. Operand 9266 states and 13117 transitions. [2019-10-03 02:53:01,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-03 02:53:01,590 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:01,590 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:53:01,590 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:01,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:01,591 INFO L82 PathProgramCache]: Analyzing trace with hash 546386693, now seen corresponding path program 1 times [2019-10-03 02:53:01,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:01,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:01,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:01,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:01,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:03,280 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-03 02:53:03,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:03,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2019-10-03 02:53:03,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:03,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-03 02:53:03,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-03 02:53:03,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-10-03 02:53:03,283 INFO L87 Difference]: Start difference. First operand 9266 states and 13117 transitions. Second operand 40 states. [2019-10-03 02:53:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:05,058 INFO L93 Difference]: Finished difference Result 9338 states and 13209 transitions. [2019-10-03 02:53:05,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-03 02:53:05,058 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 308 [2019-10-03 02:53:05,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:05,093 INFO L225 Difference]: With dead ends: 9338 [2019-10-03 02:53:05,093 INFO L226 Difference]: Without dead ends: 9338 [2019-10-03 02:53:05,094 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=149, Invalid=3157, Unknown=0, NotChecked=0, Total=3306 [2019-10-03 02:53:05,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9338 states. [2019-10-03 02:53:05,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9338 to 9321. [2019-10-03 02:53:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9321 states. [2019-10-03 02:53:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9321 states to 9321 states and 13184 transitions. [2019-10-03 02:53:05,315 INFO L78 Accepts]: Start accepts. Automaton has 9321 states and 13184 transitions. Word has length 308 [2019-10-03 02:53:05,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:05,316 INFO L475 AbstractCegarLoop]: Abstraction has 9321 states and 13184 transitions. [2019-10-03 02:53:05,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-03 02:53:05,316 INFO L276 IsEmpty]: Start isEmpty. Operand 9321 states and 13184 transitions. [2019-10-03 02:53:05,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-10-03 02:53:05,341 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:05,342 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:53:05,342 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:05,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:05,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1783797644, now seen corresponding path program 1 times [2019-10-03 02:53:05,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:05,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:05,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:05,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:05,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:06,432 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-03 02:53:06,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:06,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2019-10-03 02:53:06,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:06,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-03 02:53:06,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-03 02:53:06,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-10-03 02:53:06,435 INFO L87 Difference]: Start difference. First operand 9321 states and 13184 transitions. Second operand 40 states. [2019-10-03 02:53:08,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:08,140 INFO L93 Difference]: Finished difference Result 9531 states and 13446 transitions. [2019-10-03 02:53:08,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-03 02:53:08,141 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 301 [2019-10-03 02:53:08,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:08,172 INFO L225 Difference]: With dead ends: 9531 [2019-10-03 02:53:08,172 INFO L226 Difference]: Without dead ends: 9531 [2019-10-03 02:53:08,173 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=149, Invalid=3157, Unknown=0, NotChecked=0, Total=3306 [2019-10-03 02:53:08,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9531 states. [2019-10-03 02:53:08,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9531 to 9514. [2019-10-03 02:53:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9514 states. [2019-10-03 02:53:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9514 states to 9514 states and 13421 transitions. [2019-10-03 02:53:08,378 INFO L78 Accepts]: Start accepts. Automaton has 9514 states and 13421 transitions. Word has length 301 [2019-10-03 02:53:08,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:08,378 INFO L475 AbstractCegarLoop]: Abstraction has 9514 states and 13421 transitions. [2019-10-03 02:53:08,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-03 02:53:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 9514 states and 13421 transitions. [2019-10-03 02:53:08,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-03 02:53:08,405 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:08,405 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:53:08,405 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:08,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:08,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1132897773, now seen corresponding path program 1 times [2019-10-03 02:53:08,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:08,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:08,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:08,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:08,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-03 02:53:09,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:09,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2019-10-03 02:53:09,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:09,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-03 02:53:09,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-03 02:53:09,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-10-03 02:53:09,475 INFO L87 Difference]: Start difference. First operand 9514 states and 13421 transitions. Second operand 42 states. [2019-10-03 02:53:11,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:11,470 INFO L93 Difference]: Finished difference Result 9582 states and 13507 transitions. [2019-10-03 02:53:11,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-03 02:53:11,480 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 310 [2019-10-03 02:53:11,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:11,512 INFO L225 Difference]: With dead ends: 9582 [2019-10-03 02:53:11,512 INFO L226 Difference]: Without dead ends: 9582 [2019-10-03 02:53:11,513 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=157, Invalid=3503, Unknown=0, NotChecked=0, Total=3660 [2019-10-03 02:53:11,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9582 states. [2019-10-03 02:53:11,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9582 to 9565. [2019-10-03 02:53:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9565 states. [2019-10-03 02:53:11,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9565 states to 9565 states and 13482 transitions. [2019-10-03 02:53:11,759 INFO L78 Accepts]: Start accepts. Automaton has 9565 states and 13482 transitions. Word has length 310 [2019-10-03 02:53:11,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:11,760 INFO L475 AbstractCegarLoop]: Abstraction has 9565 states and 13482 transitions. [2019-10-03 02:53:11,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-03 02:53:11,760 INFO L276 IsEmpty]: Start isEmpty. Operand 9565 states and 13482 transitions. [2019-10-03 02:53:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-10-03 02:53:11,775 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:11,776 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:53:11,776 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:11,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:11,777 INFO L82 PathProgramCache]: Analyzing trace with hash -629732835, now seen corresponding path program 1 times [2019-10-03 02:53:11,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:11,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:11,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:11,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:11,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:11,944 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-03 02:53:11,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:11,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:53:11,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:11,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:53:11,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:53:11,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:53:11,947 INFO L87 Difference]: Start difference. First operand 9565 states and 13482 transitions. Second operand 3 states. [2019-10-03 02:53:12,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:12,093 INFO L93 Difference]: Finished difference Result 6613 states and 9187 transitions. [2019-10-03 02:53:12,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:53:12,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-10-03 02:53:12,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:12,120 INFO L225 Difference]: With dead ends: 6613 [2019-10-03 02:53:12,120 INFO L226 Difference]: Without dead ends: 6613 [2019-10-03 02:53:12,120 INFO L640 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-10-03 02:53:12,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6613 states. [2019-10-03 02:53:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6613 to 6610. [2019-10-03 02:53:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6610 states. [2019-10-03 02:53:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6610 states to 6610 states and 9185 transitions. [2019-10-03 02:53:12,272 INFO L78 Accepts]: Start accepts. Automaton has 6610 states and 9185 transitions. Word has length 307 [2019-10-03 02:53:12,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:12,272 INFO L475 AbstractCegarLoop]: Abstraction has 6610 states and 9185 transitions. [2019-10-03 02:53:12,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:53:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 6610 states and 9185 transitions. [2019-10-03 02:53:12,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-10-03 02:53:12,286 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:12,286 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:53:12,286 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:12,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:12,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1050992862, now seen corresponding path program 1 times [2019-10-03 02:53:12,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:12,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:12,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:12,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:12,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:12,874 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-03 02:53:12,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:53:12,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:53:12,876 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 318 with the following transitions: [2019-10-03 02:53:12,879 INFO L207 CegarAbsIntRunner]: [44], [46], [49], [51], [53], [56], [80], [83], [93], [107], [114], [116], [124], [129], [153], [182], [185], [189], [191], [193], [195], [197], [199], [201], [203], [205], [206], [207], [210], [328], [331], [332], [333], [336], [342], [387], [389], [400], [403], [412], [413], [416], [418], [422], [423], [426], [436], [437], [451], [454], [475], [477], [489], [511], [514], [516], [708], [709], [715], [720], [725], [728], [734], [767], [770], [784], [815], [820], [823], [829], [832], [838], [841], [847], [850], [856], [859], [865], [868], [872], [894], [895], [906], [908], [921], [923], [926], [930], [954], [958], [961], [969], [972], [976], [977], [980], [985], [988], [1005], [1008], [1023], [1026], [1033], [1042], [1046], [1048], [1050], [1053], [1066], [1073], [1076], [1082], [1084], [1276], [1404], [1406], [1409], [1413], [1414], [1416], [1418], [1425], [1429], [1501], [1504], [1509], [1510], [1511], [1520], [1524], [1527], [1529], [1543], [1546], [1550], [1551], [1554], [1557], [1588], [1589], [1591], [1616], [1629], [1631], [1714], [1717], [1723], [1726], [1728], [1729], [1734], [1755], [1758], [1772], [1781], [1784], [1793], [1918], [1919], [1995], [1997], [1999], [2001], [2002], [2014], [2015], [2016], [2017], [2018], [2019], [2020], [2024], [2025], [2026], [2030], [2031], [2040], [2048], [2058], [2059], [2062], [2063], [2064], [2065], [2066], [2067], [2068], [2069], [2070], [2071], [2072], [2073], [2074], [2075], [2076], [2077], [2078], [2079], [2080], [2081], [2088], [2089], [2090], [2091], [2118], [2119], [2124], [2125], [2128], [2134], [2138], [2139], [2154], [2155], [2156], [2157], [2158], [2188], [2204], [2205], [2206], [2208], [2209], [2214], [2215], [2216], [2217], [2218], [2219], [2220], [2221], [2222], [2224], [2225], [2228], [2232], [2233], [2234], [2235], [2250], [2251], [2252], [2253], [2254], [2282], [2284], [2286], [2287], [2290], [2291], [2292], [2293], [2298], [2300], [2304], [2305], [2306], [2320], [2321], [2324], [2325], [2336], [2344], [2345], [2346], [2348], [2349], [2352], [2376], [2377], [2378], [2379], [2380], [2381], [2382], [2383], [2384] [2019-10-03 02:53:12,978 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:53:12,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:53:13,176 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:53:13,178 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 196 root evaluator evaluations with a maximum evaluation depth of 0. Performed 196 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 382 variables. [2019-10-03 02:53:13,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:13,183 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:53:13,351 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:53:13,352 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:53:13,362 INFO L420 sIntCurrentIteration]: We unified 316 AI predicates to 316 [2019-10-03 02:53:13,363 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:53:13,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:53:13,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [21] total 21 [2019-10-03 02:53:13,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:13,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:53:13,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:53:13,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:53:13,366 INFO L87 Difference]: Start difference. First operand 6610 states and 9185 transitions. Second operand 2 states. [2019-10-03 02:53:13,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:13,368 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:53:13,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:53:13,368 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 317 [2019-10-03 02:53:13,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:13,369 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:53:13,369 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:53:13,370 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:53:13,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:53:13,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:53:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:53:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:53:13,371 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 317 [2019-10-03 02:53:13,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:13,371 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:53:13,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:53:13,371 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:53:13,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:53:13,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:53:13 BoogieIcfgContainer [2019-10-03 02:53:13,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:53:13,386 INFO L168 Benchmark]: Toolchain (without parser) took 39328.13 ms. Allocated memory was 137.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 82.0 MB in the beginning and 978.7 MB in the end (delta: -896.7 MB). Peak memory consumption was 245.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:53:13,387 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:53:13,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1371.33 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 81.8 MB in the beginning and 103.2 MB in the end (delta: -21.4 MB). Peak memory consumption was 48.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:53:13,389 INFO L168 Benchmark]: Boogie Preprocessor took 244.13 ms. Allocated memory is still 200.8 MB. Free memory was 103.2 MB in the beginning and 93.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:53:13,390 INFO L168 Benchmark]: RCFGBuilder took 2589.81 ms. Allocated memory was 200.8 MB in the beginning and 273.2 MB in the end (delta: 72.4 MB). Free memory was 93.4 MB in the beginning and 101.5 MB in the end (delta: -8.1 MB). Peak memory consumption was 64.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:53:13,394 INFO L168 Benchmark]: TraceAbstraction took 35116.97 ms. Allocated memory was 273.2 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 101.5 MB in the beginning and 978.7 MB in the end (delta: -877.2 MB). Peak memory consumption was 129.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:53:13,404 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.23 ms. Allocated memory is still 137.9 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1371.33 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 81.8 MB in the beginning and 103.2 MB in the end (delta: -21.4 MB). Peak memory consumption was 48.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 244.13 ms. Allocated memory is still 200.8 MB. Free memory was 103.2 MB in the beginning and 93.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2589.81 ms. Allocated memory was 200.8 MB in the beginning and 273.2 MB in the end (delta: 72.4 MB). Free memory was 93.4 MB in the beginning and 101.5 MB in the end (delta: -8.1 MB). Peak memory consumption was 64.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35116.97 ms. Allocated memory was 273.2 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 101.5 MB in the beginning and 978.7 MB in the end (delta: -877.2 MB). Peak memory consumption was 129.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 409]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 135 procedures, 972 locations, 1 error locations. SAFE Result, 35.0s OverallTime, 22 OverallIterations, 8 TraceHistogramMax, 19.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24334 SDtfs, 12321 SDslu, 251540 SDs, 0 SdLazy, 15143 SolverSat, 1223 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 748 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 913 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9565occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.768987341772152 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 156 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 6159 NumberOfCodeBlocks, 6159 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 6137 ConstructedInterpolants, 0 QuantifiedInterpolants, 2231339 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 21 PerfectInterpolantSequences, 2458/2462 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...