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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec6_product20.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:25:10,779 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:25:10,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:25:10,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:25:10,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:25:10,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:25:10,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:25:10,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:25:10,799 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:25:10,800 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:25:10,801 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:25:10,802 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:25:10,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:25:10,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:25:10,804 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:25:10,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:25:10,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:25:10,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:25:10,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:25:10,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:25:10,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:25:10,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:25:10,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:25:10,815 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:25:10,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:25:10,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:25:10,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:25:10,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:25:10,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:25:10,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:25:10,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:25:10,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:25:10,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:25:10,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:25:10,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:25:10,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:25:10,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:25:10,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:25:10,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:25:10,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:25:10,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:25:10,829 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 05:25:10,850 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:25:10,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:25:10,851 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:25:10,852 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:25:10,852 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:25:10,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:25:10,852 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:25:10,852 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:25:10,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:25:10,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:25:10,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:25:10,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:25:10,853 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:25:10,854 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:25:10,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:25:10,854 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:25:10,854 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:25:10,854 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:25:10,855 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:25:10,855 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:25:10,855 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:25:10,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:25:10,855 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:25:10,856 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:25:10,856 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:25:10,856 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:25:10,856 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:25:10,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:25:10,857 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:25:10,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:25:10,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:25:10,901 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:25:10,902 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:25:10,903 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:25:10,903 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec6_product20.cil.c [2019-09-08 05:25:10,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dc090f2b/aa59ac077ca84bbdbfe1fe4691059b45/FLAG7bc83a0fd [2019-09-08 05:25:11,486 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:25:11,489 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec6_product20.cil.c [2019-09-08 05:25:11,529 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dc090f2b/aa59ac077ca84bbdbfe1fe4691059b45/FLAG7bc83a0fd [2019-09-08 05:25:11,719 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dc090f2b/aa59ac077ca84bbdbfe1fe4691059b45 [2019-09-08 05:25:11,730 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:25:11,731 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:25:11,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:25:11,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:25:11,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:25:11,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:25:11" (1/1) ... [2019-09-08 05:25:11,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626530f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:11, skipping insertion in model container [2019-09-08 05:25:11,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:25:11" (1/1) ... [2019-09-08 05:25:11,748 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:25:11,821 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:25:12,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:25:12,570 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:25:12,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:25:12,745 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:25:12,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:12 WrapperNode [2019-09-08 05:25:12,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:25:12,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:25:12,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:25:12,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:25:12,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:12" (1/1) ... [2019-09-08 05:25:12,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:12" (1/1) ... [2019-09-08 05:25:12,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:12" (1/1) ... [2019-09-08 05:25:12,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:12" (1/1) ... [2019-09-08 05:25:12,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:12" (1/1) ... [2019-09-08 05:25:12,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:12" (1/1) ... [2019-09-08 05:25:12,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:12" (1/1) ... [2019-09-08 05:25:12,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:25:12,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:25:12,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:25:12,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:25:12,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:12" (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-09-08 05:25:13,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:25:13,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:25:13,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:25:13,056 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:25:13,057 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:25:13,057 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:25:13,057 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:25:13,058 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:25:13,058 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:25:13,059 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:25:13,059 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:25:13,059 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:25:13,060 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:25:13,060 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:25:13,062 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:25:13,062 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:25:13,064 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:25:13,065 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:25:13,065 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:25:13,065 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:25:13,065 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:25:13,065 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:25:13,066 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:25:13,066 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:25:13,066 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:25:13,066 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:25:13,066 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:25:13,067 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:25:13,067 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:25:13,067 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:25:13,067 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:25:13,068 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:25:13,068 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:25:13,068 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:25:13,068 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:25:13,069 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:25:13,069 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:25:13,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:25:13,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:25:13,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:25:13,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:25:13,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:25:13,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:25:13,070 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:25:13,070 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:25:13,070 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:25:13,071 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:25:13,071 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:25:13,071 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:25:13,072 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:25:13,072 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:25:13,072 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:25:13,072 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:25:13,072 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:25:13,072 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:25:13,073 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:25:13,073 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:25:13,073 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:25:13,073 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:25:13,073 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:25:13,074 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:25:13,074 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:25:13,074 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:25:13,074 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:25:13,074 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-08 05:25:13,074 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-08 05:25:13,075 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:25:13,075 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:25:13,075 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:25:13,075 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:25:13,076 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:25:13,076 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:25:13,076 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:25:13,076 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:25:13,077 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:25:13,077 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:25:13,077 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:25:13,077 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:25:13,078 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:25:13,078 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:25:13,078 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:25:13,078 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:25:13,079 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:25:13,079 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:25:13,079 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:25:13,079 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 05:25:13,079 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 05:25:13,080 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:25:13,080 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:25:13,081 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:25:13,081 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:25:13,082 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:25:13,082 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:25:13,082 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 05:25:13,082 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-09-08 05:25:13,082 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:25:13,082 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:25:13,082 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:25:13,083 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:25:13,083 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:25:13,083 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:25:13,083 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:25:13,083 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:25:13,083 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:25:13,084 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 05:25:13,084 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 05:25:13,084 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:25:13,084 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:25:13,084 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:25:13,084 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:25:13,084 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:25:13,085 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:25:13,085 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:25:13,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:25:13,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:25:13,085 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:25:13,085 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:25:13,086 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:25:13,086 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:25:13,086 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:25:13,087 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 05:25:13,087 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:25:13,087 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:25:13,087 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:25:13,089 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:25:13,089 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 05:25:13,089 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:25:13,089 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:25:13,089 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:25:13,089 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:25:13,089 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:25:13,090 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:25:13,090 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:25:13,090 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:25:13,091 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:25:13,091 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:25:13,091 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:25:13,091 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:25:13,091 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:25:13,092 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:25:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:25:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:25:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:25:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:25:13,105 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:25:13,106 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:25:13,106 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:25:13,106 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:25:13,106 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:25:13,106 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:25:13,106 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:25:13,106 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:25:13,107 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:25:13,107 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:25:13,107 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:25:13,108 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:25:13,108 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:25:13,108 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:25:13,108 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:25:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:25:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:25:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:25:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:25:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:25:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:25:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:25:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:25:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:25:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:25:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:25:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:25:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:25:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:25:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:25:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:25:13,111 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:25:13,111 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:25:13,111 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:25:13,111 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:25:13,111 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:25:13,111 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:25:13,111 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:25:13,111 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:25:13,112 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:25:13,112 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:25:13,112 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:25:13,112 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:25:13,112 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:25:13,112 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:25:13,112 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:25:13,112 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:25:13,113 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:25:13,113 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:25:13,113 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:25:13,113 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:25:13,114 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:25:13,114 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:25:13,114 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:25:13,114 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:25:13,114 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:25:13,114 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:25:13,114 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-08 05:25:13,114 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-08 05:25:13,115 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:25:13,115 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:25:13,115 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:25:13,115 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:25:13,115 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:25:13,115 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:25:13,115 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:25:13,116 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:25:13,116 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:25:13,116 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:25:13,116 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:25:13,116 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:25:13,116 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:25:13,116 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:25:13,116 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:25:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:25:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:25:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:25:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:25:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:25:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:25:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:25:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:25:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 05:25:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 05:25:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:25:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:25:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 05:25:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-09-08 05:25:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:25:13,119 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:25:13,119 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:25:13,119 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:25:13,119 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:25:13,119 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:25:13,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:25:13,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:25:13,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:25:15,334 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:25:15,334 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:25:15,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:25:15 BoogieIcfgContainer [2019-09-08 05:25:15,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:25:15,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:25:15,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:25:15,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:25:15,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:25:11" (1/3) ... [2019-09-08 05:25:15,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af18531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:25:15, skipping insertion in model container [2019-09-08 05:25:15,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:12" (2/3) ... [2019-09-08 05:25:15,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af18531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:25:15, skipping insertion in model container [2019-09-08 05:25:15,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:25:15" (3/3) ... [2019-09-08 05:25:15,345 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec6_product20.cil.c [2019-09-08 05:25:15,355 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:25:15,368 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:25:15,386 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:25:15,431 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:25:15,432 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:25:15,432 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:25:15,432 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:25:15,432 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:25:15,432 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:25:15,432 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:25:15,432 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:25:15,432 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:25:15,462 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states. [2019-09-08 05:25:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 05:25:15,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:15,494 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:25:15,497 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:15,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:15,504 INFO L82 PathProgramCache]: Analyzing trace with hash 493567878, now seen corresponding path program 1 times [2019-09-08 05:25:15,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:15,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:15,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:15,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:15,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:16,209 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:25:16,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:16,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:25:16,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:25:16,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:25:16,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:25:16,235 INFO L87 Difference]: Start difference. First operand 567 states. Second operand 2 states. [2019-09-08 05:25:16,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:16,350 INFO L93 Difference]: Finished difference Result 772 states and 1057 transitions. [2019-09-08 05:25:16,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:25:16,352 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 185 [2019-09-08 05:25:16,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:16,387 INFO L225 Difference]: With dead ends: 772 [2019-09-08 05:25:16,387 INFO L226 Difference]: Without dead ends: 514 [2019-09-08 05:25:16,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-09-08 05:25:16,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-09-08 05:25:16,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2019-09-08 05:25:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-09-08 05:25:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 707 transitions. [2019-09-08 05:25:16,505 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 707 transitions. Word has length 185 [2019-09-08 05:25:16,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:16,507 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 707 transitions. [2019-09-08 05:25:16,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:25:16,508 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 707 transitions. [2019-09-08 05:25:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 05:25:16,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:16,516 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:25:16,516 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:16,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:16,516 INFO L82 PathProgramCache]: Analyzing trace with hash 532061428, now seen corresponding path program 1 times [2019-09-08 05:25:16,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:16,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:16,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:16,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:16,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:25:16,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:16,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:25:16,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:25:16,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:25:16,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:25:16,719 INFO L87 Difference]: Start difference. First operand 514 states and 707 transitions. Second operand 3 states. [2019-09-08 05:25:16,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:16,788 INFO L93 Difference]: Finished difference Result 755 states and 1022 transitions. [2019-09-08 05:25:16,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:25:16,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-09-08 05:25:16,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:16,794 INFO L225 Difference]: With dead ends: 755 [2019-09-08 05:25:16,794 INFO L226 Difference]: Without dead ends: 517 [2019-09-08 05:25:16,796 INFO L628 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-09-08 05:25:16,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-09-08 05:25:16,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 516. [2019-09-08 05:25:16,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-09-08 05:25:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 709 transitions. [2019-09-08 05:25:16,832 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 709 transitions. Word has length 186 [2019-09-08 05:25:16,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:16,833 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 709 transitions. [2019-09-08 05:25:16,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:25:16,833 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 709 transitions. [2019-09-08 05:25:16,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 05:25:16,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:16,839 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:25:16,839 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:16,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:16,839 INFO L82 PathProgramCache]: Analyzing trace with hash -347325980, now seen corresponding path program 1 times [2019-09-08 05:25:16,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:16,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:16,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:16,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:16,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:17,066 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:25:17,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:17,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:25:17,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:25:17,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:25:17,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:25:17,068 INFO L87 Difference]: Start difference. First operand 516 states and 709 transitions. Second operand 3 states. [2019-09-08 05:25:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:17,113 INFO L93 Difference]: Finished difference Result 1010 states and 1419 transitions. [2019-09-08 05:25:17,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:25:17,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-09-08 05:25:17,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:17,120 INFO L225 Difference]: With dead ends: 1010 [2019-09-08 05:25:17,120 INFO L226 Difference]: Without dead ends: 559 [2019-09-08 05:25:17,122 INFO L628 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-09-08 05:25:17,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-08 05:25:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 558. [2019-09-08 05:25:17,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-09-08 05:25:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 781 transitions. [2019-09-08 05:25:17,177 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 781 transitions. Word has length 196 [2019-09-08 05:25:17,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:17,178 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 781 transitions. [2019-09-08 05:25:17,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:25:17,178 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 781 transitions. [2019-09-08 05:25:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-08 05:25:17,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:17,187 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:25:17,187 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:17,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:17,188 INFO L82 PathProgramCache]: Analyzing trace with hash -326965868, now seen corresponding path program 1 times [2019-09-08 05:25:17,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:17,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:17,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:17,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:17,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:17,393 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:25:17,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:17,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:25:17,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:25:17,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:25:17,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:25:17,395 INFO L87 Difference]: Start difference. First operand 558 states and 781 transitions. Second operand 3 states. [2019-09-08 05:25:17,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:17,426 INFO L93 Difference]: Finished difference Result 1133 states and 1630 transitions. [2019-09-08 05:25:17,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:25:17,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-09-08 05:25:17,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:17,431 INFO L225 Difference]: With dead ends: 1133 [2019-09-08 05:25:17,432 INFO L226 Difference]: Without dead ends: 640 [2019-09-08 05:25:17,434 INFO L628 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-09-08 05:25:17,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-09-08 05:25:17,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 639. [2019-09-08 05:25:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 05:25:17,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 919 transitions. [2019-09-08 05:25:17,460 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 919 transitions. Word has length 197 [2019-09-08 05:25:17,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:17,461 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 919 transitions. [2019-09-08 05:25:17,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:25:17,461 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 919 transitions. [2019-09-08 05:25:17,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-08 05:25:17,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:17,466 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:25:17,466 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:17,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:17,467 INFO L82 PathProgramCache]: Analyzing trace with hash 175812164, now seen corresponding path program 1 times [2019-09-08 05:25:17,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:17,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:17,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:17,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:17,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:17,674 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:25:17,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:17,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:25:17,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:25:17,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:25:17,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:25:17,676 INFO L87 Difference]: Start difference. First operand 639 states and 919 transitions. Second operand 3 states. [2019-09-08 05:25:17,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:17,715 INFO L93 Difference]: Finished difference Result 1370 states and 2034 transitions. [2019-09-08 05:25:17,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:25:17,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-09-08 05:25:17,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:17,723 INFO L225 Difference]: With dead ends: 1370 [2019-09-08 05:25:17,723 INFO L226 Difference]: Without dead ends: 796 [2019-09-08 05:25:17,725 INFO L628 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-09-08 05:25:17,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-09-08 05:25:17,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 795. [2019-09-08 05:25:17,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-09-08 05:25:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1183 transitions. [2019-09-08 05:25:17,763 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1183 transitions. Word has length 198 [2019-09-08 05:25:17,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:17,764 INFO L475 AbstractCegarLoop]: Abstraction has 795 states and 1183 transitions. [2019-09-08 05:25:17,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:25:17,764 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1183 transitions. [2019-09-08 05:25:17,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 05:25:17,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:17,770 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:25:17,770 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:17,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:17,771 INFO L82 PathProgramCache]: Analyzing trace with hash 517583156, now seen corresponding path program 1 times [2019-09-08 05:25:17,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:17,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:17,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:17,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:17,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:17,937 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:25:17,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:17,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:25:17,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:25:17,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:25:17,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:25:17,939 INFO L87 Difference]: Start difference. First operand 795 states and 1183 transitions. Second operand 3 states. [2019-09-08 05:25:17,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:17,987 INFO L93 Difference]: Finished difference Result 1826 states and 2806 transitions. [2019-09-08 05:25:17,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:25:17,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-09-08 05:25:17,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:17,996 INFO L225 Difference]: With dead ends: 1826 [2019-09-08 05:25:17,997 INFO L226 Difference]: Without dead ends: 1096 [2019-09-08 05:25:18,000 INFO L628 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-09-08 05:25:18,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2019-09-08 05:25:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1095. [2019-09-08 05:25:18,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2019-09-08 05:25:18,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1687 transitions. [2019-09-08 05:25:18,049 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1687 transitions. Word has length 199 [2019-09-08 05:25:18,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:18,049 INFO L475 AbstractCegarLoop]: Abstraction has 1095 states and 1687 transitions. [2019-09-08 05:25:18,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:25:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1687 transitions. [2019-09-08 05:25:18,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 05:25:18,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:18,057 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:25:18,057 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:18,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:18,058 INFO L82 PathProgramCache]: Analyzing trace with hash 2061438023, now seen corresponding path program 1 times [2019-09-08 05:25:18,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:18,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:18,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:18,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:18,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:25:18,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:18,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:25:18,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:25:18,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:25:18,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:25:18,389 INFO L87 Difference]: Start difference. First operand 1095 states and 1687 transitions. Second operand 11 states. [2019-09-08 05:25:23,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:23,349 INFO L93 Difference]: Finished difference Result 3067 states and 4548 transitions. [2019-09-08 05:25:23,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 05:25:23,350 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 202 [2019-09-08 05:25:23,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:23,366 INFO L225 Difference]: With dead ends: 3067 [2019-09-08 05:25:23,367 INFO L226 Difference]: Without dead ends: 2842 [2019-09-08 05:25:23,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 05:25:23,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2019-09-08 05:25:23,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 2821. [2019-09-08 05:25:23,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2821 states. [2019-09-08 05:25:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 4142 transitions. [2019-09-08 05:25:23,506 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 4142 transitions. Word has length 202 [2019-09-08 05:25:23,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:23,506 INFO L475 AbstractCegarLoop]: Abstraction has 2821 states and 4142 transitions. [2019-09-08 05:25:23,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:25:23,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 4142 transitions. [2019-09-08 05:25:23,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-08 05:25:23,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:23,514 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:25:23,515 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:23,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:23,515 INFO L82 PathProgramCache]: Analyzing trace with hash 836940569, now seen corresponding path program 1 times [2019-09-08 05:25:23,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:23,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:23,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:23,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:23,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:25:23,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:23,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:25:23,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:25:23,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:25:23,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:25:23,848 INFO L87 Difference]: Start difference. First operand 2821 states and 4142 transitions. Second operand 18 states. [2019-09-08 05:25:24,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:24,431 INFO L93 Difference]: Finished difference Result 4807 states and 7068 transitions. [2019-09-08 05:25:24,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:25:24,431 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 203 [2019-09-08 05:25:24,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:24,451 INFO L225 Difference]: With dead ends: 4807 [2019-09-08 05:25:24,451 INFO L226 Difference]: Without dead ends: 2838 [2019-09-08 05:25:24,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:25:24,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2019-09-08 05:25:24,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2836. [2019-09-08 05:25:24,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2836 states. [2019-09-08 05:25:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2836 states to 2836 states and 4143 transitions. [2019-09-08 05:25:24,631 INFO L78 Accepts]: Start accepts. Automaton has 2836 states and 4143 transitions. Word has length 203 [2019-09-08 05:25:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:24,632 INFO L475 AbstractCegarLoop]: Abstraction has 2836 states and 4143 transitions. [2019-09-08 05:25:24,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:25:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 4143 transitions. [2019-09-08 05:25:24,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 05:25:24,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:24,640 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:25:24,640 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:24,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:24,641 INFO L82 PathProgramCache]: Analyzing trace with hash -17476821, now seen corresponding path program 1 times [2019-09-08 05:25:24,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:24,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:24,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:24,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:24,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:24,846 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:25:24,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:24,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:25:24,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:25:24,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:25:24,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:25:24,849 INFO L87 Difference]: Start difference. First operand 2836 states and 4143 transitions. Second operand 6 states. [2019-09-08 05:25:25,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:25,613 INFO L93 Difference]: Finished difference Result 7697 states and 11356 transitions. [2019-09-08 05:25:25,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:25:25,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 212 [2019-09-08 05:25:25,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:25,670 INFO L225 Difference]: With dead ends: 7697 [2019-09-08 05:25:25,671 INFO L226 Difference]: Without dead ends: 5759 [2019-09-08 05:25:25,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:25:25,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5759 states. [2019-09-08 05:25:26,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5759 to 5688. [2019-09-08 05:25:26,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5688 states. [2019-09-08 05:25:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5688 states to 5688 states and 8455 transitions. [2019-09-08 05:25:26,177 INFO L78 Accepts]: Start accepts. Automaton has 5688 states and 8455 transitions. Word has length 212 [2019-09-08 05:25:26,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:26,178 INFO L475 AbstractCegarLoop]: Abstraction has 5688 states and 8455 transitions. [2019-09-08 05:25:26,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:25:26,178 INFO L276 IsEmpty]: Start isEmpty. Operand 5688 states and 8455 transitions. [2019-09-08 05:25:26,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 05:25:26,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:26,193 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:25:26,194 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:26,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:26,194 INFO L82 PathProgramCache]: Analyzing trace with hash -924380084, now seen corresponding path program 1 times [2019-09-08 05:25:26,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:26,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:26,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:26,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:26,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:25:26,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:26,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:25:26,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:25:26,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:25:26,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:25:26,432 INFO L87 Difference]: Start difference. First operand 5688 states and 8455 transitions. Second operand 11 states. [2019-09-08 05:25:27,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:27,009 INFO L93 Difference]: Finished difference Result 9703 states and 14196 transitions. [2019-09-08 05:25:27,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:25:27,010 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 213 [2019-09-08 05:25:27,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:27,046 INFO L225 Difference]: With dead ends: 9703 [2019-09-08 05:25:27,046 INFO L226 Difference]: Without dead ends: 5742 [2019-09-08 05:25:27,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:25:27,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5742 states. [2019-09-08 05:25:27,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5742 to 5724. [2019-09-08 05:25:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5724 states. [2019-09-08 05:25:27,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5724 states to 5724 states and 8491 transitions. [2019-09-08 05:25:27,431 INFO L78 Accepts]: Start accepts. Automaton has 5724 states and 8491 transitions. Word has length 213 [2019-09-08 05:25:27,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:27,432 INFO L475 AbstractCegarLoop]: Abstraction has 5724 states and 8491 transitions. [2019-09-08 05:25:27,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:25:27,432 INFO L276 IsEmpty]: Start isEmpty. Operand 5724 states and 8491 transitions. [2019-09-08 05:25:27,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 05:25:27,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:27,449 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:25:27,449 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:27,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:27,450 INFO L82 PathProgramCache]: Analyzing trace with hash -337603965, now seen corresponding path program 1 times [2019-09-08 05:25:27,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:27,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:27,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:27,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:27,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:27,725 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:25:27,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:27,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:25:27,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:25:27,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:25:27,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:25:27,727 INFO L87 Difference]: Start difference. First operand 5724 states and 8491 transitions. Second operand 5 states. [2019-09-08 05:25:29,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:29,213 INFO L93 Difference]: Finished difference Result 19279 states and 28365 transitions. [2019-09-08 05:25:29,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 05:25:29,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 213 [2019-09-08 05:25:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:29,319 INFO L225 Difference]: With dead ends: 19279 [2019-09-08 05:25:29,319 INFO L226 Difference]: Without dead ends: 15284 [2019-09-08 05:25:29,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:25:29,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15284 states. [2019-09-08 05:25:30,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15284 to 15172. [2019-09-08 05:25:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15172 states. [2019-09-08 05:25:30,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15172 states to 15172 states and 22439 transitions. [2019-09-08 05:25:30,185 INFO L78 Accepts]: Start accepts. Automaton has 15172 states and 22439 transitions. Word has length 213 [2019-09-08 05:25:30,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:30,186 INFO L475 AbstractCegarLoop]: Abstraction has 15172 states and 22439 transitions. [2019-09-08 05:25:30,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:25:30,187 INFO L276 IsEmpty]: Start isEmpty. Operand 15172 states and 22439 transitions. [2019-09-08 05:25:30,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-08 05:25:30,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:30,214 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:25:30,214 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:30,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:30,214 INFO L82 PathProgramCache]: Analyzing trace with hash 667026014, now seen corresponding path program 1 times [2019-09-08 05:25:30,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:30,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:30,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:30,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:30,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:25:30,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:30,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:25:30,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:25:30,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:25:30,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:25:30,460 INFO L87 Difference]: Start difference. First operand 15172 states and 22439 transitions. Second operand 8 states. [2019-09-08 05:25:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:36,288 INFO L93 Difference]: Finished difference Result 45882 states and 70315 transitions. [2019-09-08 05:25:36,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:25:36,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 235 [2019-09-08 05:25:36,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:36,457 INFO L225 Difference]: With dead ends: 45882 [2019-09-08 05:25:36,458 INFO L226 Difference]: Without dead ends: 30775 [2019-09-08 05:25:36,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:25:36,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30775 states. [2019-09-08 05:25:37,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30775 to 18756. [2019-09-08 05:25:37,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18756 states. [2019-09-08 05:25:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18756 states to 18756 states and 29827 transitions. [2019-09-08 05:25:38,055 INFO L78 Accepts]: Start accepts. Automaton has 18756 states and 29827 transitions. Word has length 235 [2019-09-08 05:25:38,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:38,056 INFO L475 AbstractCegarLoop]: Abstraction has 18756 states and 29827 transitions. [2019-09-08 05:25:38,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:25:38,056 INFO L276 IsEmpty]: Start isEmpty. Operand 18756 states and 29827 transitions. [2019-09-08 05:25:38,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-08 05:25:38,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:38,129 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:25:38,130 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:38,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:38,130 INFO L82 PathProgramCache]: Analyzing trace with hash 901490695, now seen corresponding path program 1 times [2019-09-08 05:25:38,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:38,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:38,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:38,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:38,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:38,343 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:25:38,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:38,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:25:38,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:25:38,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:25:38,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:25:38,345 INFO L87 Difference]: Start difference. First operand 18756 states and 29827 transitions. Second operand 8 states. [2019-09-08 05:25:44,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:44,549 INFO L93 Difference]: Finished difference Result 57170 states and 95735 transitions. [2019-09-08 05:25:44,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:25:44,549 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 236 [2019-09-08 05:25:44,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:44,753 INFO L225 Difference]: With dead ends: 57170 [2019-09-08 05:25:44,753 INFO L226 Difference]: Without dead ends: 38479 [2019-09-08 05:25:44,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:25:44,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38479 states. [2019-09-08 05:25:46,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38479 to 26044. [2019-09-08 05:25:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26044 states. [2019-09-08 05:25:46,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26044 states to 26044 states and 45947 transitions. [2019-09-08 05:25:46,302 INFO L78 Accepts]: Start accepts. Automaton has 26044 states and 45947 transitions. Word has length 236 [2019-09-08 05:25:46,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:46,303 INFO L475 AbstractCegarLoop]: Abstraction has 26044 states and 45947 transitions. [2019-09-08 05:25:46,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:25:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 26044 states and 45947 transitions. [2019-09-08 05:25:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 05:25:46,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:46,423 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:25:46,423 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:46,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:46,424 INFO L82 PathProgramCache]: Analyzing trace with hash -396837894, now seen corresponding path program 1 times [2019-09-08 05:25:46,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:46,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:46,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:46,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:46,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:25:46,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:46,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:25:46,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:25:46,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:25:46,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:25:46,626 INFO L87 Difference]: Start difference. First operand 26044 states and 45947 transitions. Second operand 8 states. [2019-09-08 05:25:53,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:53,706 INFO L93 Difference]: Finished difference Result 80018 states and 150563 transitions. [2019-09-08 05:25:53,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:25:53,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 237 [2019-09-08 05:25:53,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:54,093 INFO L225 Difference]: With dead ends: 80018 [2019-09-08 05:25:54,094 INFO L226 Difference]: Without dead ends: 54039 [2019-09-08 05:25:54,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:25:54,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54039 states. [2019-09-08 05:25:57,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54039 to 40748. [2019-09-08 05:25:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40748 states. [2019-09-08 05:25:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40748 states to 40748 states and 80735 transitions. [2019-09-08 05:25:57,744 INFO L78 Accepts]: Start accepts. Automaton has 40748 states and 80735 transitions. Word has length 237 [2019-09-08 05:25:57,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:57,745 INFO L475 AbstractCegarLoop]: Abstraction has 40748 states and 80735 transitions. [2019-09-08 05:25:57,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:25:57,745 INFO L276 IsEmpty]: Start isEmpty. Operand 40748 states and 80735 transitions. [2019-09-08 05:25:57,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 05:25:57,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:57,945 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:25:57,945 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:57,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:57,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1777004491, now seen corresponding path program 1 times [2019-09-08 05:25:57,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:57,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:57,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:57,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:57,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:25:58,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:58,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:25:58,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:25:58,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:25:58,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:25:58,201 INFO L87 Difference]: Start difference. First operand 40748 states and 80735 transitions. Second operand 11 states. [2019-09-08 05:26:00,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:26:00,418 INFO L93 Difference]: Finished difference Result 61541 states and 112068 transitions. [2019-09-08 05:26:00,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 05:26:00,419 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 241 [2019-09-08 05:26:00,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:26:00,686 INFO L225 Difference]: With dead ends: 61541 [2019-09-08 05:26:00,686 INFO L226 Difference]: Without dead ends: 52842 [2019-09-08 05:26:00,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:26:00,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52842 states. [2019-09-08 05:26:05,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52842 to 52214. [2019-09-08 05:26:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52214 states. [2019-09-08 05:26:05,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52214 states to 52214 states and 98445 transitions. [2019-09-08 05:26:05,455 INFO L78 Accepts]: Start accepts. Automaton has 52214 states and 98445 transitions. Word has length 241 [2019-09-08 05:26:05,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:26:05,456 INFO L475 AbstractCegarLoop]: Abstraction has 52214 states and 98445 transitions. [2019-09-08 05:26:05,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:26:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 52214 states and 98445 transitions. [2019-09-08 05:26:05,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 05:26:05,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:26:05,576 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:26:05,577 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:26:05,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:26:05,577 INFO L82 PathProgramCache]: Analyzing trace with hash 494477452, now seen corresponding path program 1 times [2019-09-08 05:26:05,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:26:05,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:26:05,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:05,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:26:05,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:26:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:26:05,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:26:05,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:26:05,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:26:05,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:26:05,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:26:05,771 INFO L87 Difference]: Start difference. First operand 52214 states and 98445 transitions. Second operand 6 states. [2019-09-08 05:26:08,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:26:08,203 INFO L93 Difference]: Finished difference Result 104495 states and 198861 transitions. [2019-09-08 05:26:08,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:26:08,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 242 [2019-09-08 05:26:08,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:26:08,568 INFO L225 Difference]: With dead ends: 104495 [2019-09-08 05:26:08,569 INFO L226 Difference]: Without dead ends: 52346 [2019-09-08 05:26:08,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:26:08,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52346 states. [2019-09-08 05:26:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52346 to 52346. [2019-09-08 05:26:13,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52346 states. [2019-09-08 05:26:13,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52346 states to 52346 states and 98023 transitions. [2019-09-08 05:26:13,497 INFO L78 Accepts]: Start accepts. Automaton has 52346 states and 98023 transitions. Word has length 242 [2019-09-08 05:26:13,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:26:13,498 INFO L475 AbstractCegarLoop]: Abstraction has 52346 states and 98023 transitions. [2019-09-08 05:26:13,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:26:13,498 INFO L276 IsEmpty]: Start isEmpty. Operand 52346 states and 98023 transitions. [2019-09-08 05:26:13,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-08 05:26:13,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:26:13,615 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:26:13,615 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:26:13,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:26:13,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1036626879, now seen corresponding path program 1 times [2019-09-08 05:26:13,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:26:13,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:26:13,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:13,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:26:13,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:26:14,038 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:26:14,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:26:14,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 05:26:14,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 05:26:14,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 05:26:14,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:26:14,040 INFO L87 Difference]: Start difference. First operand 52346 states and 98023 transitions. Second operand 22 states. [2019-09-08 05:26:35,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:26:35,037 INFO L93 Difference]: Finished difference Result 151652 states and 288265 transitions. [2019-09-08 05:26:35,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 05:26:35,037 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 243 [2019-09-08 05:26:35,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:26:38,621 INFO L225 Difference]: With dead ends: 151652 [2019-09-08 05:26:38,622 INFO L226 Difference]: Without dead ends: 133233 [2019-09-08 05:26:38,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=483, Invalid=4209, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 05:26:38,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133233 states. [2019-09-08 05:26:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133233 to 129104. [2019-09-08 05:26:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129104 states. [2019-09-08 05:26:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129104 states to 129104 states and 247381 transitions. [2019-09-08 05:26:45,024 INFO L78 Accepts]: Start accepts. Automaton has 129104 states and 247381 transitions. Word has length 243 [2019-09-08 05:26:45,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:26:45,025 INFO L475 AbstractCegarLoop]: Abstraction has 129104 states and 247381 transitions. [2019-09-08 05:26:45,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 05:26:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 129104 states and 247381 transitions. [2019-09-08 05:26:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 05:26:45,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:26:45,256 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:26:45,256 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:26:45,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:26:45,257 INFO L82 PathProgramCache]: Analyzing trace with hash -515938117, now seen corresponding path program 1 times [2019-09-08 05:26:45,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:26:45,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:26:45,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:45,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:26:45,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:26:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:26:45,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:26:45,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:26:45,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:26:45,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:26:45,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:26:45,420 INFO L87 Difference]: Start difference. First operand 129104 states and 247381 transitions. Second operand 6 states. [2019-09-08 05:26:51,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:26:51,645 INFO L93 Difference]: Finished difference Result 257875 states and 508163 transitions. [2019-09-08 05:26:51,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:26:51,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 245 [2019-09-08 05:26:51,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:26:52,241 INFO L225 Difference]: With dead ends: 257875 [2019-09-08 05:26:52,241 INFO L226 Difference]: Without dead ends: 128848 [2019-09-08 05:26:58,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:26:58,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128848 states. [2019-09-08 05:27:04,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128848 to 128848. [2019-09-08 05:27:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128848 states. [2019-09-08 05:27:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128848 states to 128848 states and 227859 transitions. [2019-09-08 05:27:05,007 INFO L78 Accepts]: Start accepts. Automaton has 128848 states and 227859 transitions. Word has length 245 [2019-09-08 05:27:05,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:27:05,008 INFO L475 AbstractCegarLoop]: Abstraction has 128848 states and 227859 transitions. [2019-09-08 05:27:05,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:27:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 128848 states and 227859 transitions. [2019-09-08 05:27:05,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 05:27:05,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:27:05,222 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:27:05,222 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:27:05,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:27:05,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1651154368, now seen corresponding path program 1 times [2019-09-08 05:27:05,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:27:05,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:27:05,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:05,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:27:05,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:27:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:27:05,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:27:05,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:27:05,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:27:05,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:27:05,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:27:05,373 INFO L87 Difference]: Start difference. First operand 128848 states and 227859 transitions. Second operand 5 states. [2019-09-08 05:27:12,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:27:12,473 INFO L93 Difference]: Finished difference Result 174281 states and 306163 transitions. [2019-09-08 05:27:12,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:27:12,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 244 [2019-09-08 05:27:12,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:27:12,983 INFO L225 Difference]: With dead ends: 174281 [2019-09-08 05:27:12,983 INFO L226 Difference]: Without dead ends: 131284 [2019-09-08 05:27:13,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:27:13,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131284 states. [2019-09-08 05:27:23,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131284 to 129999. [2019-09-08 05:27:23,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129999 states. [2019-09-08 05:27:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129999 states to 129999 states and 229277 transitions. [2019-09-08 05:27:23,965 INFO L78 Accepts]: Start accepts. Automaton has 129999 states and 229277 transitions. Word has length 244 [2019-09-08 05:27:23,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:27:23,965 INFO L475 AbstractCegarLoop]: Abstraction has 129999 states and 229277 transitions. [2019-09-08 05:27:23,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:27:23,965 INFO L276 IsEmpty]: Start isEmpty. Operand 129999 states and 229277 transitions. [2019-09-08 05:27:24,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 05:27:24,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:27:24,135 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:27:24,135 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:27:24,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:27:24,135 INFO L82 PathProgramCache]: Analyzing trace with hash 2031723054, now seen corresponding path program 1 times [2019-09-08 05:27:24,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:27:24,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:27:24,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:24,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:27:24,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:27:24,471 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:27:24,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:27:24,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:27:24,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:27:24,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:27:24,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:27:24,472 INFO L87 Difference]: Start difference. First operand 129999 states and 229277 transitions. Second operand 18 states. [2019-09-08 05:27:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:27:43,836 INFO L93 Difference]: Finished difference Result 220272 states and 387794 transitions. [2019-09-08 05:27:43,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 05:27:43,837 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 244 [2019-09-08 05:27:43,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:27:44,346 INFO L225 Difference]: With dead ends: 220272 [2019-09-08 05:27:44,347 INFO L226 Difference]: Without dead ends: 141780 [2019-09-08 05:27:44,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 970 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=423, Invalid=3483, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 05:27:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141780 states. [2019-09-08 05:27:55,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141780 to 138246. [2019-09-08 05:27:55,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138246 states. [2019-09-08 05:27:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138246 states to 138246 states and 246033 transitions. [2019-09-08 05:27:56,478 INFO L78 Accepts]: Start accepts. Automaton has 138246 states and 246033 transitions. Word has length 244 [2019-09-08 05:27:56,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:27:56,479 INFO L475 AbstractCegarLoop]: Abstraction has 138246 states and 246033 transitions. [2019-09-08 05:27:56,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:27:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 138246 states and 246033 transitions. [2019-09-08 05:27:56,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 05:27:56,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:27:56,674 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:27:56,674 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:27:56,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:27:56,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1105634612, now seen corresponding path program 1 times [2019-09-08 05:27:56,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:27:56,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:27:56,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:56,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:27:56,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:27:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 05:27:56,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:27:56,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 05:27:56,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 05:27:56,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 05:27:56,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-08 05:27:56,965 INFO L87 Difference]: Start difference. First operand 138246 states and 246033 transitions. Second operand 16 states. [2019-09-08 05:28:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:28:04,301 INFO L93 Difference]: Finished difference Result 231525 states and 404233 transitions. [2019-09-08 05:28:04,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 05:28:04,301 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 244 [2019-09-08 05:28:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:28:04,811 INFO L225 Difference]: With dead ends: 231525 [2019-09-08 05:28:04,811 INFO L226 Difference]: Without dead ends: 137426 [2019-09-08 05:28:05,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:28:05,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137426 states. [2019-09-08 05:28:16,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137426 to 137162. [2019-09-08 05:28:16,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137162 states. [2019-09-08 05:28:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137162 states to 137162 states and 241127 transitions. [2019-09-08 05:28:17,111 INFO L78 Accepts]: Start accepts. Automaton has 137162 states and 241127 transitions. Word has length 244 [2019-09-08 05:28:17,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:28:17,111 INFO L475 AbstractCegarLoop]: Abstraction has 137162 states and 241127 transitions. [2019-09-08 05:28:17,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 05:28:17,112 INFO L276 IsEmpty]: Start isEmpty. Operand 137162 states and 241127 transitions. [2019-09-08 05:28:17,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 05:28:17,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:28:17,299 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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] [2019-09-08 05:28:17,299 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:28:17,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:28:17,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1259438208, now seen corresponding path program 1 times [2019-09-08 05:28:17,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:28:17,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:28:17,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:17,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:28:17,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:28:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-08 05:28:18,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:28:18,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:28:18,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:28:18,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:28:18,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:28:18,321 INFO L87 Difference]: Start difference. First operand 137162 states and 241127 transitions. Second operand 18 states. [2019-09-08 05:28:39,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:28:39,182 INFO L93 Difference]: Finished difference Result 213346 states and 368821 transitions. [2019-09-08 05:28:39,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 05:28:39,183 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 262 [2019-09-08 05:28:39,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:28:39,692 INFO L225 Difference]: With dead ends: 213346 [2019-09-08 05:28:39,692 INFO L226 Difference]: Without dead ends: 139779 [2019-09-08 05:28:39,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=423, Invalid=3483, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 05:28:39,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139779 states. [2019-09-08 05:28:47,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139779 to 137162. [2019-09-08 05:28:47,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137162 states. [2019-09-08 05:28:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137162 states to 137162 states and 241127 transitions. [2019-09-08 05:28:48,444 INFO L78 Accepts]: Start accepts. Automaton has 137162 states and 241127 transitions. Word has length 262 [2019-09-08 05:28:48,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:28:48,445 INFO L475 AbstractCegarLoop]: Abstraction has 137162 states and 241127 transitions. [2019-09-08 05:28:48,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:28:48,445 INFO L276 IsEmpty]: Start isEmpty. Operand 137162 states and 241127 transitions. [2019-09-08 05:28:48,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 05:28:48,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:28:48,605 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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] [2019-09-08 05:28:48,605 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:28:48,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:28:48,606 INFO L82 PathProgramCache]: Analyzing trace with hash 850613983, now seen corresponding path program 1 times [2019-09-08 05:28:48,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:28:48,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:28:48,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:48,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:28:48,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:28:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 05:28:48,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:28:48,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:28:48,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:28:48,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:28:48,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:28:48,772 INFO L87 Difference]: Start difference. First operand 137162 states and 241127 transitions. Second operand 6 states. [2019-09-08 05:28:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:28:59,129 INFO L93 Difference]: Finished difference Result 274335 states and 482682 transitions. [2019-09-08 05:28:59,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:28:59,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 262 [2019-09-08 05:28:59,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:29:00,087 INFO L225 Difference]: With dead ends: 274335 [2019-09-08 05:29:00,087 INFO L226 Difference]: Without dead ends: 137262 [2019-09-08 05:29:00,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:29:00,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137262 states. [2019-09-08 05:29:11,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137262 to 137258. [2019-09-08 05:29:11,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137258 states. [2019-09-08 05:29:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137258 states to 137258 states and 241224 transitions. [2019-09-08 05:29:12,513 INFO L78 Accepts]: Start accepts. Automaton has 137258 states and 241224 transitions. Word has length 262 [2019-09-08 05:29:12,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:29:12,514 INFO L475 AbstractCegarLoop]: Abstraction has 137258 states and 241224 transitions. [2019-09-08 05:29:12,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:29:12,514 INFO L276 IsEmpty]: Start isEmpty. Operand 137258 states and 241224 transitions. [2019-09-08 05:29:12,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-08 05:29:12,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:29:12,682 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:29:12,683 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:29:12,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:29:12,683 INFO L82 PathProgramCache]: Analyzing trace with hash 368919404, now seen corresponding path program 1 times [2019-09-08 05:29:12,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:29:12,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:29:12,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:29:12,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:29:12,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:29:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:29:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:29:12,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:29:12,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:29:12,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:29:12,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:29:12,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:29:12,830 INFO L87 Difference]: Start difference. First operand 137258 states and 241224 transitions. Second operand 5 states. [2019-09-08 05:29:17,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:29:17,916 INFO L93 Difference]: Finished difference Result 210133 states and 356773 transitions. [2019-09-08 05:29:17,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:29:17,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2019-09-08 05:29:17,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:29:18,316 INFO L225 Difference]: With dead ends: 210133 [2019-09-08 05:29:18,316 INFO L226 Difference]: Without dead ends: 117004 [2019-09-08 05:29:18,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:29:18,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117004 states. [2019-09-08 05:29:29,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117004 to 116856. [2019-09-08 05:29:29,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116856 states. [2019-09-08 05:29:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116856 states to 116856 states and 206286 transitions. [2019-09-08 05:29:30,287 INFO L78 Accepts]: Start accepts. Automaton has 116856 states and 206286 transitions. Word has length 261 [2019-09-08 05:29:30,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:29:30,288 INFO L475 AbstractCegarLoop]: Abstraction has 116856 states and 206286 transitions. [2019-09-08 05:29:30,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:29:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 116856 states and 206286 transitions. [2019-09-08 05:29:30,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 05:29:30,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:29:30,448 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:29:30,449 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:29:30,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:29:30,449 INFO L82 PathProgramCache]: Analyzing trace with hash 770812282, now seen corresponding path program 1 times [2019-09-08 05:29:30,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:29:30,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:29:30,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:29:30,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:29:30,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:29:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:29:30,585 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:29:30,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:29:30,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:29:30,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:29:30,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:29:30,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:29:30,586 INFO L87 Difference]: Start difference. First operand 116856 states and 206286 transitions. Second operand 6 states. [2019-09-08 05:29:36,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:29:36,122 INFO L93 Difference]: Finished difference Result 233803 states and 414794 transitions. [2019-09-08 05:29:36,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:29:36,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 245 [2019-09-08 05:29:36,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:29:36,547 INFO L225 Difference]: With dead ends: 233803 [2019-09-08 05:29:36,547 INFO L226 Difference]: Without dead ends: 117036 [2019-09-08 05:29:36,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:29:36,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117036 states. [2019-09-08 05:29:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117036 to 117036. [2019-09-08 05:29:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117036 states. [2019-09-08 05:29:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117036 states to 117036 states and 206067 transitions. [2019-09-08 05:29:47,375 INFO L78 Accepts]: Start accepts. Automaton has 117036 states and 206067 transitions. Word has length 245 [2019-09-08 05:29:47,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:29:47,376 INFO L475 AbstractCegarLoop]: Abstraction has 117036 states and 206067 transitions. [2019-09-08 05:29:47,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:29:47,376 INFO L276 IsEmpty]: Start isEmpty. Operand 117036 states and 206067 transitions. [2019-09-08 05:29:47,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-08 05:29:47,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:29:47,551 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:29:47,551 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:29:47,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:29:47,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1850790211, now seen corresponding path program 1 times [2019-09-08 05:29:47,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:29:47,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:29:47,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:29:47,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:29:47,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:29:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:29:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:29:47,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:29:47,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:29:47,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:29:47,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:29:47,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:29:47,692 INFO L87 Difference]: Start difference. First operand 117036 states and 206067 transitions. Second operand 6 states. [2019-09-08 05:29:53,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:29:53,145 INFO L93 Difference]: Finished difference Result 233983 states and 421244 transitions. [2019-09-08 05:29:53,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:29:53,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 248 [2019-09-08 05:29:53,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:29:53,641 INFO L225 Difference]: With dead ends: 233983 [2019-09-08 05:29:53,641 INFO L226 Difference]: Without dead ends: 117036 [2019-09-08 05:29:53,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:29:53,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117036 states. [2019-09-08 05:30:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117036 to 117036. [2019-09-08 05:30:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117036 states. [2019-09-08 05:30:08,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117036 states to 117036 states and 200973 transitions. [2019-09-08 05:30:08,362 INFO L78 Accepts]: Start accepts. Automaton has 117036 states and 200973 transitions. Word has length 248 [2019-09-08 05:30:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:30:08,363 INFO L475 AbstractCegarLoop]: Abstraction has 117036 states and 200973 transitions. [2019-09-08 05:30:08,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:30:08,363 INFO L276 IsEmpty]: Start isEmpty. Operand 117036 states and 200973 transitions. [2019-09-08 05:30:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 05:30:08,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:30:08,520 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:30:08,520 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:30:08,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:30:08,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1894239098, now seen corresponding path program 1 times [2019-09-08 05:30:08,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:30:08,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:30:08,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:30:08,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:30:08,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:30:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:30:08,664 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:30:08,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:30:08,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:30:08,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:30:08,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:30:08,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:30:08,666 INFO L87 Difference]: Start difference. First operand 117036 states and 200973 transitions. Second operand 6 states. [2019-09-08 05:30:13,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:30:13,858 INFO L93 Difference]: Finished difference Result 234079 states and 402320 transitions. [2019-09-08 05:30:13,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:30:13,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 268 [2019-09-08 05:30:13,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:30:14,249 INFO L225 Difference]: With dead ends: 234079 [2019-09-08 05:30:14,249 INFO L226 Difference]: Without dead ends: 117036 [2019-09-08 05:30:14,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:30:14,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117036 states. [2019-09-08 05:30:20,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117036 to 117036. [2019-09-08 05:30:20,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117036 states. [2019-09-08 05:30:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117036 states to 117036 states and 200925 transitions. [2019-09-08 05:30:20,737 INFO L78 Accepts]: Start accepts. Automaton has 117036 states and 200925 transitions. Word has length 268 [2019-09-08 05:30:20,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:30:20,738 INFO L475 AbstractCegarLoop]: Abstraction has 117036 states and 200925 transitions. [2019-09-08 05:30:20,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:30:20,738 INFO L276 IsEmpty]: Start isEmpty. Operand 117036 states and 200925 transitions. [2019-09-08 05:30:20,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-08 05:30:20,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:30:20,897 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:30:20,897 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:30:20,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:30:20,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1532755175, now seen corresponding path program 1 times [2019-09-08 05:30:20,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:30:20,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:30:20,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:30:20,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:30:20,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:30:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:30:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:30:21,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:30:21,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:30:21,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:30:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:30:21,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 3157 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:30:21,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:30:21,767 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 05:30:21,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:30:21,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2019-09-08 05:30:21,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:30:21,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:30:21,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:30:21,785 INFO L87 Difference]: Start difference. First operand 117036 states and 200925 transitions. Second operand 13 states. [2019-09-08 05:30:34,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:30:34,105 INFO L93 Difference]: Finished difference Result 234020 states and 401788 transitions. [2019-09-08 05:30:34,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:30:34,106 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 252 [2019-09-08 05:30:34,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:30:35,004 INFO L225 Difference]: With dead ends: 234020 [2019-09-08 05:30:35,005 INFO L226 Difference]: Without dead ends: 117040 [2019-09-08 05:30:35,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:30:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117040 states. [2019-09-08 05:30:44,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117040 to 117036. [2019-09-08 05:30:44,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117036 states. [2019-09-08 05:30:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117036 states to 117036 states and 200923 transitions. [2019-09-08 05:30:45,075 INFO L78 Accepts]: Start accepts. Automaton has 117036 states and 200923 transitions. Word has length 252 [2019-09-08 05:30:45,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:30:45,075 INFO L475 AbstractCegarLoop]: Abstraction has 117036 states and 200923 transitions. [2019-09-08 05:30:45,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:30:45,076 INFO L276 IsEmpty]: Start isEmpty. Operand 117036 states and 200923 transitions. [2019-09-08 05:30:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-08 05:30:45,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:30:45,483 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:30:45,484 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:30:45,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:30:45,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1325568172, now seen corresponding path program 1 times [2019-09-08 05:30:45,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:30:45,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:30:45,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:30:45,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:30:45,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:30:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:30:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 05:30:45,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:30:45,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:30:45,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:30:45,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:30:45,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:30:45,670 INFO L87 Difference]: Start difference. First operand 117036 states and 200923 transitions. Second operand 7 states. [2019-09-08 05:30:51,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:30:51,223 INFO L93 Difference]: Finished difference Result 233994 states and 401753 transitions. [2019-09-08 05:30:51,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:30:51,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 271 [2019-09-08 05:30:51,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:30:51,781 INFO L225 Difference]: With dead ends: 233994 [2019-09-08 05:30:51,781 INFO L226 Difference]: Without dead ends: 117038 [2019-09-08 05:30:52,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:30:52,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117038 states. [2019-09-08 05:31:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117038 to 117036. [2019-09-08 05:31:05,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117036 states. [2019-09-08 05:31:05,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117036 states to 117036 states and 200922 transitions. [2019-09-08 05:31:05,818 INFO L78 Accepts]: Start accepts. Automaton has 117036 states and 200922 transitions. Word has length 271 [2019-09-08 05:31:05,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:31:05,818 INFO L475 AbstractCegarLoop]: Abstraction has 117036 states and 200922 transitions. [2019-09-08 05:31:05,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:31:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 117036 states and 200922 transitions. [2019-09-08 05:31:05,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-08 05:31:05,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:31:05,989 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-09-08 05:31:05,989 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:31:05,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:31:05,989 INFO L82 PathProgramCache]: Analyzing trace with hash 852025640, now seen corresponding path program 2 times [2019-09-08 05:31:05,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:31:05,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:31:05,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:05,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:31:05,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:31:06,206 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:31:06,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:31:06,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:31:06,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 05:31:06,753 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 05:31:06,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:31:06,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 3223 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 05:31:06,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:31:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:31:06,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:31:06,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-09-08 05:31:06,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 05:31:06,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 05:31:06,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:31:06,987 INFO L87 Difference]: Start difference. First operand 117036 states and 200922 transitions. Second operand 19 states. [2019-09-08 05:31:24,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:31:24,684 INFO L93 Difference]: Finished difference Result 324062 states and 568170 transitions. [2019-09-08 05:31:24,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 05:31:24,684 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 272 [2019-09-08 05:31:24,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:31:26,673 INFO L225 Difference]: With dead ends: 324062 [2019-09-08 05:31:26,673 INFO L226 Difference]: Without dead ends: 268457 [2019-09-08 05:31:26,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=992, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 05:31:27,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268457 states. [2019-09-08 05:31:49,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268457 to 236095. [2019-09-08 05:31:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236095 states. [2019-09-08 05:31:50,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236095 states to 236095 states and 408350 transitions. [2019-09-08 05:31:50,204 INFO L78 Accepts]: Start accepts. Automaton has 236095 states and 408350 transitions. Word has length 272 [2019-09-08 05:31:50,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:31:50,205 INFO L475 AbstractCegarLoop]: Abstraction has 236095 states and 408350 transitions. [2019-09-08 05:31:50,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 05:31:50,205 INFO L276 IsEmpty]: Start isEmpty. Operand 236095 states and 408350 transitions. [2019-09-08 05:31:50,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-08 05:31:50,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:31:50,647 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:31:50,647 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:31:50,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:31:50,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1029932282, now seen corresponding path program 1 times [2019-09-08 05:31:50,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:31:50,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:31:50,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:50,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:31:50,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:31:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-08 05:31:50,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:31:50,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:31:50,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:31:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:31:51,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 3286 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:31:51,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:31:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:31:51,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:31:51,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2019-09-08 05:31:51,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:31:51,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:31:51,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:31:51,479 INFO L87 Difference]: Start difference. First operand 236095 states and 408350 transitions. Second operand 13 states. [2019-09-08 05:32:10,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:32:10,522 INFO L93 Difference]: Finished difference Result 472472 states and 816966 transitions. [2019-09-08 05:32:10,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:32:10,522 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 290 [2019-09-08 05:32:10,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:32:11,656 INFO L225 Difference]: With dead ends: 472472 [2019-09-08 05:32:11,657 INFO L226 Difference]: Without dead ends: 236485 [2019-09-08 05:32:12,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:32:12,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236485 states. [2019-09-08 05:32:28,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236485 to 236099. [2019-09-08 05:32:28,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236099 states. [2019-09-08 05:32:29,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236099 states to 236099 states and 408352 transitions. [2019-09-08 05:32:29,325 INFO L78 Accepts]: Start accepts. Automaton has 236099 states and 408352 transitions. Word has length 290 [2019-09-08 05:32:29,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:32:29,325 INFO L475 AbstractCegarLoop]: Abstraction has 236099 states and 408352 transitions. [2019-09-08 05:32:29,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:32:29,325 INFO L276 IsEmpty]: Start isEmpty. Operand 236099 states and 408352 transitions. [2019-09-08 05:32:29,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-08 05:32:29,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:32:29,710 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-09-08 05:32:29,710 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:32:29,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:32:29,710 INFO L82 PathProgramCache]: Analyzing trace with hash 194205940, now seen corresponding path program 1 times [2019-09-08 05:32:29,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:32:29,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:32:29,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:32:29,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:32:29,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:32:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:32:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:32:29,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:32:29,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:32:29,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:32:29,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:32:29,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:32:29,917 INFO L87 Difference]: Start difference. First operand 236099 states and 408352 transitions. Second operand 9 states. [2019-09-08 05:32:48,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:32:48,856 INFO L93 Difference]: Finished difference Result 472092 states and 816580 transitions. [2019-09-08 05:32:48,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:32:48,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 274 [2019-09-08 05:32:48,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:32:49,874 INFO L225 Difference]: With dead ends: 472092 [2019-09-08 05:32:49,874 INFO L226 Difference]: Without dead ends: 236105 [2019-09-08 05:32:50,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-08 05:32:50,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236105 states. [2019-09-08 05:33:04,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236105 to 236099. [2019-09-08 05:33:04,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236099 states. [2019-09-08 05:33:05,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236099 states to 236099 states and 408350 transitions. [2019-09-08 05:33:05,197 INFO L78 Accepts]: Start accepts. Automaton has 236099 states and 408350 transitions. Word has length 274 [2019-09-08 05:33:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:33:05,197 INFO L475 AbstractCegarLoop]: Abstraction has 236099 states and 408350 transitions. [2019-09-08 05:33:05,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:33:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 236099 states and 408350 transitions. [2019-09-08 05:33:05,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-08 05:33:05,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:33:05,610 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 05:33:05,611 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:33:05,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:33:05,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1924564238, now seen corresponding path program 1 times [2019-09-08 05:33:05,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:33:05,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:33:05,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:05,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:33:05,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:33:07,134 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:33:07,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:33:07,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 05:33:07,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 05:33:07,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 05:33:07,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:33:07,136 INFO L87 Difference]: Start difference. First operand 236099 states and 408350 transitions. Second operand 20 states. [2019-09-08 05:33:28,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:33:28,332 INFO L93 Difference]: Finished difference Result 300685 states and 514275 transitions. [2019-09-08 05:33:28,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 05:33:28,333 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 258 [2019-09-08 05:33:28,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:33:29,366 INFO L225 Difference]: With dead ends: 300685 [2019-09-08 05:33:29,366 INFO L226 Difference]: Without dead ends: 275930 [2019-09-08 05:33:29,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=292, Invalid=1870, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 05:33:29,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275930 states. [2019-09-08 05:33:46,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275930 to 273035. [2019-09-08 05:33:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273035 states. [2019-09-08 05:33:47,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273035 states to 273035 states and 470890 transitions. [2019-09-08 05:33:47,307 INFO L78 Accepts]: Start accepts. Automaton has 273035 states and 470890 transitions. Word has length 258 [2019-09-08 05:33:47,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:33:47,308 INFO L475 AbstractCegarLoop]: Abstraction has 273035 states and 470890 transitions. [2019-09-08 05:33:47,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 05:33:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 273035 states and 470890 transitions. [2019-09-08 05:33:47,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-08 05:33:47,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:33:47,726 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-09-08 05:33:47,726 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:33:47,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:33:47,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1886663405, now seen corresponding path program 1 times [2019-09-08 05:33:47,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:33:47,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:33:47,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:47,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:33:47,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:33:49,281 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 05:33:49,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:33:49,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:33:49,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:33:49,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:33:49,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:33:49,283 INFO L87 Difference]: Start difference. First operand 273035 states and 470890 transitions. Second operand 7 states. [2019-09-08 05:34:20,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:34:20,958 INFO L93 Difference]: Finished difference Result 623625 states and 1082160 transitions. [2019-09-08 05:34:20,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:34:20,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 278 [2019-09-08 05:34:20,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:34:24,018 INFO L225 Difference]: With dead ends: 623625 [2019-09-08 05:34:24,018 INFO L226 Difference]: Without dead ends: 548418 [2019-09-08 05:34:24,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 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-09-08 05:34:24,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548418 states. [2019-09-08 05:35:14,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548418 to 544609. [2019-09-08 05:35:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544609 states. [2019-09-08 05:35:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544609 states to 544609 states and 946974 transitions. [2019-09-08 05:35:18,081 INFO L78 Accepts]: Start accepts. Automaton has 544609 states and 946974 transitions. Word has length 278 [2019-09-08 05:35:18,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:35:18,082 INFO L475 AbstractCegarLoop]: Abstraction has 544609 states and 946974 transitions. [2019-09-08 05:35:18,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:35:18,082 INFO L276 IsEmpty]: Start isEmpty. Operand 544609 states and 946974 transitions. [2019-09-08 05:35:19,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-08 05:35:19,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:35:19,026 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 05:35:19,026 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:35:19,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:35:19,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2045167072, now seen corresponding path program 1 times [2019-09-08 05:35:19,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:35:19,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:35:19,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:19,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:35:19,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:35:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 05:35:19,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:35:19,255 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:35:19,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:35:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:35:19,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 3164 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 05:35:19,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:35:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:35:21,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:35:21,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4] total 13 [2019-09-08 05:35:21,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:35:21,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:35:21,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:35:21,389 INFO L87 Difference]: Start difference. First operand 544609 states and 946974 transitions. Second operand 13 states.