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_spec1_product22.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:39:45,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:39:45,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:39:45,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:39:45,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:39:45,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:39:46,000 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:39:46,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:39:46,012 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:39:46,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:39:46,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:39:46,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:39:46,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:39:46,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:39:46,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:39:46,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:39:46,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:39:46,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:39:46,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:39:46,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:39:46,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:39:46,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:39:46,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:39:46,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:39:46,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:39:46,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:39:46,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:39:46,049 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:39:46,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:39:46,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:39:46,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:39:46,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:39:46,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:39:46,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:39:46,059 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:39:46,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:39:46,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:39:46,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:39:46,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:39:46,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:39:46,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:39:46,064 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 04:39:46,084 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:39:46,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:39:46,087 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:39:46,088 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:39:46,088 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:39:46,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:39:46,088 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:39:46,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:39:46,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:39:46,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:39:46,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:39:46,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:39:46,090 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:39:46,091 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:39:46,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:39:46,091 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:39:46,091 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:39:46,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:39:46,092 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:39:46,092 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:39:46,092 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:39:46,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:39:46,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:39:46,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:39:46,093 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:39:46,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:39:46,094 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:39:46,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:39:46,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:39:46,154 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:39:46,176 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:39:46,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:39:46,185 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:39:46,186 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:39:46,187 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec1_product22.cil.c [2019-09-08 04:39:46,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93bc27318/18fa6bea67fa486f94dde912593296ab/FLAG5cb28ea0b [2019-09-08 04:39:46,977 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:39:46,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product22.cil.c [2019-09-08 04:39:47,008 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93bc27318/18fa6bea67fa486f94dde912593296ab/FLAG5cb28ea0b [2019-09-08 04:39:47,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93bc27318/18fa6bea67fa486f94dde912593296ab [2019-09-08 04:39:47,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:39:47,176 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:39:47,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:39:47,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:39:47,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:39:47,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:39:47" (1/1) ... [2019-09-08 04:39:47,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6595b9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:47, skipping insertion in model container [2019-09-08 04:39:47,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:39:47" (1/1) ... [2019-09-08 04:39:47,196 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:39:47,277 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:39:48,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:39:48,089 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:39:48,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:39:48,361 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:39:48,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:48 WrapperNode [2019-09-08 04:39:48,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:39:48,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:39:48,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:39:48,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:39:48,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:48" (1/1) ... [2019-09-08 04:39:48,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:48" (1/1) ... [2019-09-08 04:39:48,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:48" (1/1) ... [2019-09-08 04:39:48,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:48" (1/1) ... [2019-09-08 04:39:48,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:48" (1/1) ... [2019-09-08 04:39:48,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:48" (1/1) ... [2019-09-08 04:39:48,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:48" (1/1) ... [2019-09-08 04:39:48,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:39:48,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:39:48,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:39:48,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:39:48,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:48" (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 04:39:48,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:39:48,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:39:48,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:39:48,702 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:39:48,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:39:48,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:39:48,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:39:48,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:39:48,704 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:39:48,704 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 04:39:48,704 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 04:39:48,705 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 04:39:48,705 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 04:39:48,705 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 04:39:48,706 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 04:39:48,707 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:39:48,709 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 04:39:48,710 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 04:39:48,710 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 04:39:48,710 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 04:39:48,711 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 04:39:48,711 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 04:39:48,711 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 04:39:48,711 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 04:39:48,712 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 04:39:48,712 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 04:39:48,712 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 04:39:48,712 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 04:39:48,713 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 04:39:48,713 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 04:39:48,713 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 04:39:48,714 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 04:39:48,714 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 04:39:48,714 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 04:39:48,714 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 04:39:48,714 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 04:39:48,715 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 04:39:48,715 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 04:39:48,715 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:39:48,715 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:39:48,715 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:39:48,715 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:39:48,716 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-09-08 04:39:48,716 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 04:39:48,716 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 04:39:48,716 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 04:39:48,716 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 04:39:48,717 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 04:39:48,717 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 04:39:48,717 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 04:39:48,717 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 04:39:48,717 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:39:48,717 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:39:48,717 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 04:39:48,718 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 04:39:48,718 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 04:39:48,718 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 04:39:48,718 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 04:39:48,718 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 04:39:48,719 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 04:39:48,719 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 04:39:48,719 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 04:39:48,719 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 04:39:48,719 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 04:39:48,720 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:39:48,720 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 04:39:48,720 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 04:39:48,720 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 04:39:48,720 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 04:39:48,721 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 04:39:48,721 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 04:39:48,721 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 04:39:48,721 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 04:39:48,721 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 04:39:48,722 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 04:39:48,722 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 04:39:48,722 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 04:39:48,722 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 04:39:48,722 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 04:39:48,723 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 04:39:48,723 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 04:39:48,723 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 04:39:48,724 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 04:39:48,724 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 04:39:48,724 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 04:39:48,724 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 04:39:48,724 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 04:39:48,725 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 04:39:48,725 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 04:39:48,725 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 04:39:48,725 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 04:39:48,726 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 04:39:48,726 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 04:39:48,726 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 04:39:48,726 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 04:39:48,727 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 04:39:48,727 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 04:39:48,727 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 04:39:48,727 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 04:39:48,727 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AutoResponder [2019-09-08 04:39:48,727 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-08 04:39:48,727 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 04:39:48,728 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 04:39:48,728 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 04:39:48,728 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 04:39:48,728 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 04:39:48,728 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 04:39:48,728 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 04:39:48,728 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 04:39:48,729 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 04:39:48,729 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 04:39:48,729 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 04:39:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:39:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:39:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:39:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:39:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:39:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:39:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:39:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:39:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:39:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:39:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:39:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:39:48,732 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:39:48,733 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:39:48,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:39:48,733 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:39:48,733 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:39:48,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:39:48,733 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:39:48,734 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:39:48,734 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 04:39:48,734 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 04:39:48,734 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 04:39:48,734 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 04:39:48,734 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 04:39:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 04:39:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 04:39:48,736 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 04:39:48,739 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 04:39:48,743 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 04:39:48,743 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 04:39:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 04:39:48,749 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 04:39:48,749 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 04:39:48,749 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 04:39:48,750 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 04:39:48,750 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 04:39:48,750 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 04:39:48,750 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 04:39:48,750 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 04:39:48,750 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 04:39:48,750 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 04:39:48,750 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 04:39:48,751 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:39:48,751 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 04:39:48,751 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 04:39:48,751 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 04:39:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 04:39:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 04:39:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 04:39:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 04:39:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 04:39:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 04:39:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 04:39:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 04:39:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 04:39:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 04:39:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 04:39:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 04:39:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:39:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:39:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:39:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:39:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:39:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 04:39:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-09-08 04:39:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 04:39:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 04:39:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 04:39:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 04:39:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 04:39:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 04:39:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 04:39:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 04:39:48,756 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 04:39:48,756 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 04:39:48,756 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 04:39:48,756 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 04:39:48,756 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 04:39:48,756 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 04:39:48,756 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 04:39:48,757 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 04:39:48,757 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 04:39:48,757 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 04:39:48,757 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 04:39:48,757 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:39:48,757 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:39:48,757 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 04:39:48,757 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 04:39:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 04:39:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 04:39:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 04:39:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 04:39:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 04:39:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 04:39:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 04:39:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 04:39:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 04:39:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 04:39:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 04:39:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 04:39:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 04:39:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 04:39:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 04:39:48,760 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 04:39:48,760 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 04:39:48,760 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 04:39:48,760 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 04:39:48,760 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 04:39:48,760 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 04:39:48,760 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 04:39:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 04:39:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 04:39:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 04:39:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 04:39:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 04:39:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 04:39:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 04:39:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 04:39:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 04:39:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 04:39:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 04:39:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AutoResponder [2019-09-08 04:39:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-08 04:39:48,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:39:48,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:39:48,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:39:50,708 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:39:50,709 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 04:39:50,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:39:50 BoogieIcfgContainer [2019-09-08 04:39:50,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:39:50,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:39:50,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:39:50,715 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:39:50,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:39:47" (1/3) ... [2019-09-08 04:39:50,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91ac692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:39:50, skipping insertion in model container [2019-09-08 04:39:50,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:48" (2/3) ... [2019-09-08 04:39:50,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91ac692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:39:50, skipping insertion in model container [2019-09-08 04:39:50,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:39:50" (3/3) ... [2019-09-08 04:39:50,719 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec1_product22.cil.c [2019-09-08 04:39:50,729 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:39:50,739 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:39:50,758 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:39:50,807 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:39:50,808 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:39:50,808 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:39:50,808 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:39:50,809 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:39:50,809 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:39:50,809 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:39:50,809 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:39:50,809 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:39:50,849 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states. [2019-09-08 04:39:50,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 04:39:50,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:50,893 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:50,900 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:50,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:50,906 INFO L82 PathProgramCache]: Analyzing trace with hash -262488185, now seen corresponding path program 1 times [2019-09-08 04:39:50,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:50,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:50,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:50,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:50,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:39:51,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:51,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 04:39:51,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 04:39:51,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 04:39:51,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:39:51,502 INFO L87 Difference]: Start difference. First operand 508 states. Second operand 2 states. [2019-09-08 04:39:51,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:51,615 INFO L93 Difference]: Finished difference Result 747 states and 983 transitions. [2019-09-08 04:39:51,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 04:39:51,617 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 145 [2019-09-08 04:39:51,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:51,640 INFO L225 Difference]: With dead ends: 747 [2019-09-08 04:39:51,640 INFO L226 Difference]: Without dead ends: 485 [2019-09-08 04:39:51,647 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 04:39:51,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-09-08 04:39:51,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2019-09-08 04:39:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-09-08 04:39:51,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 643 transitions. [2019-09-08 04:39:51,773 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 643 transitions. Word has length 145 [2019-09-08 04:39:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:51,775 INFO L475 AbstractCegarLoop]: Abstraction has 485 states and 643 transitions. [2019-09-08 04:39:51,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 04:39:51,776 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 643 transitions. [2019-09-08 04:39:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 04:39:51,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:51,783 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:51,783 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:51,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:51,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1163189320, now seen corresponding path program 1 times [2019-09-08 04:39:51,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:51,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:51,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:51,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:51,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:52,075 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:39:52,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:52,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:52,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:52,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:52,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:52,079 INFO L87 Difference]: Start difference. First operand 485 states and 643 transitions. Second operand 3 states. [2019-09-08 04:39:52,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:52,128 INFO L93 Difference]: Finished difference Result 730 states and 952 transitions. [2019-09-08 04:39:52,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:52,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-08 04:39:52,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:52,138 INFO L225 Difference]: With dead ends: 730 [2019-09-08 04:39:52,139 INFO L226 Difference]: Without dead ends: 488 [2019-09-08 04:39:52,144 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 04:39:52,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-08 04:39:52,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 487. [2019-09-08 04:39:52,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-09-08 04:39:52,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 645 transitions. [2019-09-08 04:39:52,188 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 645 transitions. Word has length 146 [2019-09-08 04:39:52,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:52,189 INFO L475 AbstractCegarLoop]: Abstraction has 487 states and 645 transitions. [2019-09-08 04:39:52,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:52,189 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 645 transitions. [2019-09-08 04:39:52,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 04:39:52,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:52,192 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:52,193 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:52,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:52,193 INFO L82 PathProgramCache]: Analyzing trace with hash -180533913, now seen corresponding path program 1 times [2019-09-08 04:39:52,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:52,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:52,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:52,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:52,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:52,359 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:39:52,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:52,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:52,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:52,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:52,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:52,361 INFO L87 Difference]: Start difference. First operand 487 states and 645 transitions. Second operand 3 states. [2019-09-08 04:39:52,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:52,454 INFO L93 Difference]: Finished difference Result 952 states and 1291 transitions. [2019-09-08 04:39:52,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:52,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-08 04:39:52,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:52,460 INFO L225 Difference]: With dead ends: 952 [2019-09-08 04:39:52,461 INFO L226 Difference]: Without dead ends: 530 [2019-09-08 04:39:52,462 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 04:39:52,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-09-08 04:39:52,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 529. [2019-09-08 04:39:52,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-09-08 04:39:52,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 717 transitions. [2019-09-08 04:39:52,505 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 717 transitions. Word has length 158 [2019-09-08 04:39:52,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:52,508 INFO L475 AbstractCegarLoop]: Abstraction has 529 states and 717 transitions. [2019-09-08 04:39:52,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:52,508 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 717 transitions. [2019-09-08 04:39:52,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 04:39:52,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:52,516 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:52,516 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:52,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:52,516 INFO L82 PathProgramCache]: Analyzing trace with hash 541479896, now seen corresponding path program 1 times [2019-09-08 04:39:52,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:52,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:52,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:52,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:52,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:39:52,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:52,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:52,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:52,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:52,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:52,700 INFO L87 Difference]: Start difference. First operand 529 states and 717 transitions. Second operand 3 states. [2019-09-08 04:39:52,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:52,730 INFO L93 Difference]: Finished difference Result 1075 states and 1502 transitions. [2019-09-08 04:39:52,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:52,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-09-08 04:39:52,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:52,736 INFO L225 Difference]: With dead ends: 1075 [2019-09-08 04:39:52,736 INFO L226 Difference]: Without dead ends: 611 [2019-09-08 04:39:52,738 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 04:39:52,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-08 04:39:52,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 610. [2019-09-08 04:39:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-09-08 04:39:52,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 855 transitions. [2019-09-08 04:39:52,763 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 855 transitions. Word has length 159 [2019-09-08 04:39:52,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:52,763 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 855 transitions. [2019-09-08 04:39:52,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:52,763 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 855 transitions. [2019-09-08 04:39:52,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 04:39:52,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:52,768 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:52,768 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:52,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:52,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1088431641, now seen corresponding path program 1 times [2019-09-08 04:39:52,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:52,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:52,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:52,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:52,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:39:52,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:52,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:52,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:52,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:52,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:52,917 INFO L87 Difference]: Start difference. First operand 610 states and 855 transitions. Second operand 3 states. [2019-09-08 04:39:52,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:52,954 INFO L93 Difference]: Finished difference Result 1312 states and 1906 transitions. [2019-09-08 04:39:52,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:52,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-08 04:39:52,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:52,960 INFO L225 Difference]: With dead ends: 1312 [2019-09-08 04:39:52,960 INFO L226 Difference]: Without dead ends: 767 [2019-09-08 04:39:52,963 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 04:39:52,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2019-09-08 04:39:52,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 766. [2019-09-08 04:39:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2019-09-08 04:39:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1119 transitions. [2019-09-08 04:39:52,994 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1119 transitions. Word has length 160 [2019-09-08 04:39:52,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:52,994 INFO L475 AbstractCegarLoop]: Abstraction has 766 states and 1119 transitions. [2019-09-08 04:39:52,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:52,994 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1119 transitions. [2019-09-08 04:39:52,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 04:39:52,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:52,999 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:53,000 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:53,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:53,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1690260276, now seen corresponding path program 1 times [2019-09-08 04:39:53,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:53,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:53,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:53,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:53,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:39:53,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:53,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:39:53,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:39:53,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:39:53,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:39:53,223 INFO L87 Difference]: Start difference. First operand 766 states and 1119 transitions. Second operand 6 states. [2019-09-08 04:39:53,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:53,818 INFO L93 Difference]: Finished difference Result 1481 states and 2187 transitions. [2019-09-08 04:39:53,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:39:53,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2019-09-08 04:39:53,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:53,826 INFO L225 Difference]: With dead ends: 1481 [2019-09-08 04:39:53,826 INFO L226 Difference]: Without dead ends: 778 [2019-09-08 04:39:53,829 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 04:39:53,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-09-08 04:39:53,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 778. [2019-09-08 04:39:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2019-09-08 04:39:53,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1134 transitions. [2019-09-08 04:39:53,881 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1134 transitions. Word has length 162 [2019-09-08 04:39:53,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:53,885 INFO L475 AbstractCegarLoop]: Abstraction has 778 states and 1134 transitions. [2019-09-08 04:39:53,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:39:53,885 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1134 transitions. [2019-09-08 04:39:53,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 04:39:53,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:53,890 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:53,890 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:53,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:53,893 INFO L82 PathProgramCache]: Analyzing trace with hash -296484008, now seen corresponding path program 1 times [2019-09-08 04:39:53,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:53,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:53,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:53,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:53,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:39:54,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:54,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:54,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:54,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:54,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:54,041 INFO L87 Difference]: Start difference. First operand 778 states and 1134 transitions. Second operand 3 states. [2019-09-08 04:39:54,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:54,146 INFO L93 Difference]: Finished difference Result 1780 states and 2692 transitions. [2019-09-08 04:39:54,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:54,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-08 04:39:54,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:54,156 INFO L225 Difference]: With dead ends: 1780 [2019-09-08 04:39:54,157 INFO L226 Difference]: Without dead ends: 1079 [2019-09-08 04:39:54,161 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 04:39:54,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-09-08 04:39:54,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1078. [2019-09-08 04:39:54,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1078 states. [2019-09-08 04:39:54,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1638 transitions. [2019-09-08 04:39:54,221 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1638 transitions. Word has length 161 [2019-09-08 04:39:54,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:54,222 INFO L475 AbstractCegarLoop]: Abstraction has 1078 states and 1638 transitions. [2019-09-08 04:39:54,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:54,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1638 transitions. [2019-09-08 04:39:54,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 04:39:54,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:54,232 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:54,232 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:54,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:54,233 INFO L82 PathProgramCache]: Analyzing trace with hash -501047075, now seen corresponding path program 1 times [2019-09-08 04:39:54,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:54,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:54,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:54,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:54,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:39:54,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:39:54,422 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 04:39:54,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:54,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 2445 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:39:54,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:39:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 04:39:55,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:39:55,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2019-09-08 04:39:55,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:39:55,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:39:55,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:39:55,257 INFO L87 Difference]: Start difference. First operand 1078 states and 1638 transitions. Second operand 13 states. [2019-09-08 04:39:56,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:56,990 INFO L93 Difference]: Finished difference Result 2114 states and 3240 transitions. [2019-09-08 04:39:56,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:39:56,991 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 163 [2019-09-08 04:39:56,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:57,000 INFO L225 Difference]: With dead ends: 2114 [2019-09-08 04:39:57,000 INFO L226 Difference]: Without dead ends: 1084 [2019-09-08 04:39:57,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:39:57,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2019-09-08 04:39:57,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1082. [2019-09-08 04:39:57,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2019-09-08 04:39:57,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1643 transitions. [2019-09-08 04:39:57,070 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1643 transitions. Word has length 163 [2019-09-08 04:39:57,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:57,071 INFO L475 AbstractCegarLoop]: Abstraction has 1082 states and 1643 transitions. [2019-09-08 04:39:57,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:39:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1643 transitions. [2019-09-08 04:39:57,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 04:39:57,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:57,078 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:39:57,078 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:57,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:57,079 INFO L82 PathProgramCache]: Analyzing trace with hash 925448506, now seen corresponding path program 1 times [2019-09-08 04:39:57,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:57,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:57,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:57,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:57,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:39:57,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:57,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:39:57,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:39:57,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:39:57,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:39:57,403 INFO L87 Difference]: Start difference. First operand 1082 states and 1643 transitions. Second operand 7 states. [2019-09-08 04:39:57,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:57,681 INFO L93 Difference]: Finished difference Result 2112 states and 3223 transitions. [2019-09-08 04:39:57,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:39:57,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 165 [2019-09-08 04:39:57,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:57,691 INFO L225 Difference]: With dead ends: 2112 [2019-09-08 04:39:57,691 INFO L226 Difference]: Without dead ends: 1096 [2019-09-08 04:39:57,698 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 04:39:57,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2019-09-08 04:39:57,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1092. [2019-09-08 04:39:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1092 states. [2019-09-08 04:39:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1654 transitions. [2019-09-08 04:39:57,767 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1654 transitions. Word has length 165 [2019-09-08 04:39:57,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:57,767 INFO L475 AbstractCegarLoop]: Abstraction has 1092 states and 1654 transitions. [2019-09-08 04:39:57,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:39:57,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1654 transitions. [2019-09-08 04:39:57,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 04:39:57,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:57,775 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:39:57,775 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:57,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:57,776 INFO L82 PathProgramCache]: Analyzing trace with hash 272538861, now seen corresponding path program 2 times [2019-09-08 04:39:57,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:57,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:57,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:57,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:57,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:57,931 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:39:57,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:57,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:39:57,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:39:57,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:39:57,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:39:57,933 INFO L87 Difference]: Start difference. First operand 1092 states and 1654 transitions. Second operand 7 states. [2019-09-08 04:39:58,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:58,248 INFO L93 Difference]: Finished difference Result 2110 states and 3222 transitions. [2019-09-08 04:39:58,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:39:58,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 166 [2019-09-08 04:39:58,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:58,267 INFO L225 Difference]: With dead ends: 2110 [2019-09-08 04:39:58,267 INFO L226 Difference]: Without dead ends: 1098 [2019-09-08 04:39:58,274 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 04:39:58,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2019-09-08 04:39:58,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1094. [2019-09-08 04:39:58,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2019-09-08 04:39:58,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1657 transitions. [2019-09-08 04:39:58,352 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1657 transitions. Word has length 166 [2019-09-08 04:39:58,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:58,353 INFO L475 AbstractCegarLoop]: Abstraction has 1094 states and 1657 transitions. [2019-09-08 04:39:58,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:39:58,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1657 transitions. [2019-09-08 04:39:58,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 04:39:58,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:58,363 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:39:58,364 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:58,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:58,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1435925621, now seen corresponding path program 1 times [2019-09-08 04:39:58,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:58,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:58,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:58,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 04:39:58,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:39:58,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:58,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:39:58,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:39:58,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:39:58,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:39:58,605 INFO L87 Difference]: Start difference. First operand 1094 states and 1657 transitions. Second operand 9 states. [2019-09-08 04:39:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:59,003 INFO L93 Difference]: Finished difference Result 2115 states and 3228 transitions. [2019-09-08 04:39:59,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:39:59,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-09-08 04:39:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:59,011 INFO L225 Difference]: With dead ends: 2115 [2019-09-08 04:39:59,011 INFO L226 Difference]: Without dead ends: 1096 [2019-09-08 04:39:59,015 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 04:39:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2019-09-08 04:39:59,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1094. [2019-09-08 04:39:59,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2019-09-08 04:39:59,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1656 transitions. [2019-09-08 04:39:59,068 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1656 transitions. Word has length 167 [2019-09-08 04:39:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:59,068 INFO L475 AbstractCegarLoop]: Abstraction has 1094 states and 1656 transitions. [2019-09-08 04:39:59,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:39:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1656 transitions. [2019-09-08 04:39:59,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 04:39:59,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:59,075 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:39:59,075 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:59,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:59,076 INFO L82 PathProgramCache]: Analyzing trace with hash 67738407, now seen corresponding path program 2 times [2019-09-08 04:39:59,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:59,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:59,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:59,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:59,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:39:59,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:59,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:39:59,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:39:59,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:39:59,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:39:59,251 INFO L87 Difference]: Start difference. First operand 1094 states and 1656 transitions. Second operand 9 states. [2019-09-08 04:39:59,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:59,560 INFO L93 Difference]: Finished difference Result 2117 states and 3229 transitions. [2019-09-08 04:39:59,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:39:59,560 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 168 [2019-09-08 04:39:59,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:59,567 INFO L225 Difference]: With dead ends: 2117 [2019-09-08 04:39:59,568 INFO L226 Difference]: Without dead ends: 1098 [2019-09-08 04:39:59,572 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 04:39:59,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2019-09-08 04:39:59,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1094. [2019-09-08 04:39:59,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2019-09-08 04:39:59,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1655 transitions. [2019-09-08 04:39:59,619 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1655 transitions. Word has length 168 [2019-09-08 04:39:59,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:59,620 INFO L475 AbstractCegarLoop]: Abstraction has 1094 states and 1655 transitions. [2019-09-08 04:39:59,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:39:59,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1655 transitions. [2019-09-08 04:39:59,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 04:39:59,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:59,626 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:39:59,626 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:59,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:59,627 INFO L82 PathProgramCache]: Analyzing trace with hash -516764614, now seen corresponding path program 1 times [2019-09-08 04:39:59,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:59,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:59,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:59,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 04:39:59,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:59,974 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 04:39:59,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:59,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 04:39:59,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 04:39:59,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 04:39:59,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:39:59,976 INFO L87 Difference]: Start difference. First operand 1094 states and 1655 transitions. Second operand 18 states. [2019-09-08 04:40:03,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:03,935 INFO L93 Difference]: Finished difference Result 2592 states and 3918 transitions. [2019-09-08 04:40:03,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 04:40:03,936 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 169 [2019-09-08 04:40:03,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:03,952 INFO L225 Difference]: With dead ends: 2592 [2019-09-08 04:40:03,952 INFO L226 Difference]: Without dead ends: 2363 [2019-09-08 04:40:03,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1549, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 04:40:03,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2019-09-08 04:40:04,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 2340. [2019-09-08 04:40:04,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2340 states. [2019-09-08 04:40:04,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 2340 states and 3599 transitions. [2019-09-08 04:40:04,074 INFO L78 Accepts]: Start accepts. Automaton has 2340 states and 3599 transitions. Word has length 169 [2019-09-08 04:40:04,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:04,075 INFO L475 AbstractCegarLoop]: Abstraction has 2340 states and 3599 transitions. [2019-09-08 04:40:04,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 04:40:04,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 3599 transitions. [2019-09-08 04:40:04,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 04:40:04,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:04,087 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:40:04,088 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:04,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:04,088 INFO L82 PathProgramCache]: Analyzing trace with hash 779369466, now seen corresponding path program 1 times [2019-09-08 04:40:04,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:04,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:04,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:04,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:04,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:04,339 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 04:40:04,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:04,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:40:04,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:40:04,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:40:04,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:40:04,341 INFO L87 Difference]: Start difference. First operand 2340 states and 3599 transitions. Second operand 9 states. [2019-09-08 04:40:04,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:04,712 INFO L93 Difference]: Finished difference Result 3084 states and 4574 transitions. [2019-09-08 04:40:04,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:40:04,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 170 [2019-09-08 04:40:04,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:04,729 INFO L225 Difference]: With dead ends: 3084 [2019-09-08 04:40:04,729 INFO L226 Difference]: Without dead ends: 2380 [2019-09-08 04:40:04,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:40:04,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2019-09-08 04:40:04,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2375. [2019-09-08 04:40:04,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2019-09-08 04:40:04,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 3653 transitions. [2019-09-08 04:40:04,867 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 3653 transitions. Word has length 170 [2019-09-08 04:40:04,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:04,867 INFO L475 AbstractCegarLoop]: Abstraction has 2375 states and 3653 transitions. [2019-09-08 04:40:04,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:40:04,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3653 transitions. [2019-09-08 04:40:04,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 04:40:04,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:04,879 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:40:04,880 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:04,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:04,880 INFO L82 PathProgramCache]: Analyzing trace with hash -669616157, now seen corresponding path program 1 times [2019-09-08 04:40:04,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:04,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:04,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:04,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:04,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:05,020 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 04:40:05,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:05,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:40:05,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:40:05,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:40:05,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:40:05,022 INFO L87 Difference]: Start difference. First operand 2375 states and 3653 transitions. Second operand 5 states. [2019-09-08 04:40:06,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:06,123 INFO L93 Difference]: Finished difference Result 4861 states and 7297 transitions. [2019-09-08 04:40:06,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:40:06,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2019-09-08 04:40:06,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:06,157 INFO L225 Difference]: With dead ends: 4861 [2019-09-08 04:40:06,157 INFO L226 Difference]: Without dead ends: 4377 [2019-09-08 04:40:06,163 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 04:40:06,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4377 states. [2019-09-08 04:40:06,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4377 to 4359. [2019-09-08 04:40:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4359 states. [2019-09-08 04:40:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4359 states to 4359 states and 6637 transitions. [2019-09-08 04:40:06,430 INFO L78 Accepts]: Start accepts. Automaton has 4359 states and 6637 transitions. Word has length 170 [2019-09-08 04:40:06,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:06,431 INFO L475 AbstractCegarLoop]: Abstraction has 4359 states and 6637 transitions. [2019-09-08 04:40:06,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:40:06,431 INFO L276 IsEmpty]: Start isEmpty. Operand 4359 states and 6637 transitions. [2019-09-08 04:40:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 04:40:06,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:06,449 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:40:06,450 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:06,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:06,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1176153543, now seen corresponding path program 1 times [2019-09-08 04:40:06,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:06,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:06,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:06,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:06,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:06,640 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 04:40:06,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:06,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:40:06,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:40:06,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:40:06,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:40:06,645 INFO L87 Difference]: Start difference. First operand 4359 states and 6637 transitions. Second operand 10 states. [2019-09-08 04:40:06,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:06,913 INFO L93 Difference]: Finished difference Result 6251 states and 9092 transitions. [2019-09-08 04:40:06,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:40:06,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 170 [2019-09-08 04:40:06,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:06,946 INFO L225 Difference]: With dead ends: 6251 [2019-09-08 04:40:06,947 INFO L226 Difference]: Without dead ends: 4350 [2019-09-08 04:40:06,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:40:06,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4350 states. [2019-09-08 04:40:07,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4350 to 4346. [2019-09-08 04:40:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4346 states. [2019-09-08 04:40:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4346 states to 4346 states and 6605 transitions. [2019-09-08 04:40:07,258 INFO L78 Accepts]: Start accepts. Automaton has 4346 states and 6605 transitions. Word has length 170 [2019-09-08 04:40:07,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:07,259 INFO L475 AbstractCegarLoop]: Abstraction has 4346 states and 6605 transitions. [2019-09-08 04:40:07,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:40:07,259 INFO L276 IsEmpty]: Start isEmpty. Operand 4346 states and 6605 transitions. [2019-09-08 04:40:07,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 04:40:07,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:07,275 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:40:07,275 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:07,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:07,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1615247298, now seen corresponding path program 1 times [2019-09-08 04:40:07,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:07,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:07,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:07,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:07,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:40:07,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:40:07,420 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) [2019-09-08 04:40:07,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:40:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:07,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 2451 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:40:07,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:40:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-08 04:40:07,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:40:07,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 04:40:07,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:40:07,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:40:07,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:40:07,872 INFO L87 Difference]: Start difference. First operand 4346 states and 6605 transitions. Second operand 5 states. [2019-09-08 04:40:08,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:08,040 INFO L93 Difference]: Finished difference Result 6405 states and 9300 transitions. [2019-09-08 04:40:08,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:40:08,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2019-09-08 04:40:08,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:08,078 INFO L225 Difference]: With dead ends: 6405 [2019-09-08 04:40:08,079 INFO L226 Difference]: Without dead ends: 4433 [2019-09-08 04:40:08,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:40:08,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4433 states. [2019-09-08 04:40:08,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4433 to 4421. [2019-09-08 04:40:08,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4421 states. [2019-09-08 04:40:08,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4421 states to 4421 states and 6718 transitions. [2019-09-08 04:40:08,467 INFO L78 Accepts]: Start accepts. Automaton has 4421 states and 6718 transitions. Word has length 170 [2019-09-08 04:40:08,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:08,468 INFO L475 AbstractCegarLoop]: Abstraction has 4421 states and 6718 transitions. [2019-09-08 04:40:08,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:40:08,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4421 states and 6718 transitions. [2019-09-08 04:40:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 04:40:08,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:08,485 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 04:40:08,485 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:08,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:08,486 INFO L82 PathProgramCache]: Analyzing trace with hash 470355602, now seen corresponding path program 1 times [2019-09-08 04:40:08,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:08,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:08,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:08,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:08,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:08,609 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:40:08,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:08,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:40:08,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:40:08,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:40:08,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:08,611 INFO L87 Difference]: Start difference. First operand 4421 states and 6718 transitions. Second operand 3 states. [2019-09-08 04:40:08,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:08,807 INFO L93 Difference]: Finished difference Result 10447 states and 16356 transitions. [2019-09-08 04:40:08,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:40:08,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-09-08 04:40:08,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:08,842 INFO L225 Difference]: With dead ends: 10447 [2019-09-08 04:40:08,842 INFO L226 Difference]: Without dead ends: 6158 [2019-09-08 04:40:08,861 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 04:40:08,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6158 states. [2019-09-08 04:40:09,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6158 to 6155. [2019-09-08 04:40:09,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6155 states. [2019-09-08 04:40:09,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6155 states to 6155 states and 9747 transitions. [2019-09-08 04:40:09,152 INFO L78 Accepts]: Start accepts. Automaton has 6155 states and 9747 transitions. Word has length 169 [2019-09-08 04:40:09,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:09,152 INFO L475 AbstractCegarLoop]: Abstraction has 6155 states and 9747 transitions. [2019-09-08 04:40:09,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:40:09,153 INFO L276 IsEmpty]: Start isEmpty. Operand 6155 states and 9747 transitions. [2019-09-08 04:40:09,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 04:40:09,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:09,175 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 04:40:09,175 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:09,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:09,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1020288295, now seen corresponding path program 1 times [2019-09-08 04:40:09,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:09,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:09,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:09,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:09,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:09,297 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:40:09,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:09,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:40:09,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:40:09,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:40:09,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:09,299 INFO L87 Difference]: Start difference. First operand 6155 states and 9747 transitions. Second operand 3 states. [2019-09-08 04:40:09,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:09,720 INFO L93 Difference]: Finished difference Result 15485 states and 25230 transitions. [2019-09-08 04:40:09,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:40:09,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-08 04:40:09,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:09,762 INFO L225 Difference]: With dead ends: 15485 [2019-09-08 04:40:09,762 INFO L226 Difference]: Without dead ends: 9472 [2019-09-08 04:40:09,786 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 04:40:09,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9472 states. [2019-09-08 04:40:10,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9472 to 9469. [2019-09-08 04:40:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9469 states. [2019-09-08 04:40:10,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9469 states to 9469 states and 15556 transitions. [2019-09-08 04:40:10,271 INFO L78 Accepts]: Start accepts. Automaton has 9469 states and 15556 transitions. Word has length 170 [2019-09-08 04:40:10,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:10,272 INFO L475 AbstractCegarLoop]: Abstraction has 9469 states and 15556 transitions. [2019-09-08 04:40:10,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:40:10,272 INFO L276 IsEmpty]: Start isEmpty. Operand 9469 states and 15556 transitions. [2019-09-08 04:40:10,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 04:40:10,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:10,308 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 04:40:10,308 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:10,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:10,309 INFO L82 PathProgramCache]: Analyzing trace with hash -680610094, now seen corresponding path program 1 times [2019-09-08 04:40:10,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:10,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:10,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:10,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:10,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:40:10,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:10,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:40:10,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:40:10,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:40:10,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:10,430 INFO L87 Difference]: Start difference. First operand 9469 states and 15556 transitions. Second operand 3 states. [2019-09-08 04:40:11,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:11,496 INFO L93 Difference]: Finished difference Result 25131 states and 42168 transitions. [2019-09-08 04:40:11,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:40:11,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-08 04:40:11,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:11,570 INFO L225 Difference]: With dead ends: 25131 [2019-09-08 04:40:11,570 INFO L226 Difference]: Without dead ends: 15810 [2019-09-08 04:40:11,610 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 04:40:11,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15810 states. [2019-09-08 04:40:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15810 to 15807. [2019-09-08 04:40:12,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15807 states. [2019-09-08 04:40:12,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15807 states to 15807 states and 26597 transitions. [2019-09-08 04:40:12,579 INFO L78 Accepts]: Start accepts. Automaton has 15807 states and 26597 transitions. Word has length 171 [2019-09-08 04:40:12,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:12,580 INFO L475 AbstractCegarLoop]: Abstraction has 15807 states and 26597 transitions. [2019-09-08 04:40:12,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:40:12,580 INFO L276 IsEmpty]: Start isEmpty. Operand 15807 states and 26597 transitions. [2019-09-08 04:40:12,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 04:40:12,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:12,915 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 04:40:12,915 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:12,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:12,916 INFO L82 PathProgramCache]: Analyzing trace with hash 712935655, now seen corresponding path program 1 times [2019-09-08 04:40:12,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:12,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:12,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:12,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:12,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:13,102 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:40:13,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:13,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:40:13,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:40:13,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:40:13,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:13,106 INFO L87 Difference]: Start difference. First operand 15807 states and 26597 transitions. Second operand 3 states. [2019-09-08 04:40:14,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:14,647 INFO L93 Difference]: Finished difference Result 44331 states and 75477 transitions. [2019-09-08 04:40:14,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:40:14,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-08 04:40:14,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:14,799 INFO L225 Difference]: With dead ends: 44331 [2019-09-08 04:40:14,799 INFO L226 Difference]: Without dead ends: 28676 [2019-09-08 04:40:14,854 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 04:40:14,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28676 states. [2019-09-08 04:40:16,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28676 to 28673. [2019-09-08 04:40:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28673 states. [2019-09-08 04:40:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28673 states to 28673 states and 48678 transitions. [2019-09-08 04:40:16,585 INFO L78 Accepts]: Start accepts. Automaton has 28673 states and 48678 transitions. Word has length 172 [2019-09-08 04:40:16,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:16,585 INFO L475 AbstractCegarLoop]: Abstraction has 28673 states and 48678 transitions. [2019-09-08 04:40:16,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:40:16,585 INFO L276 IsEmpty]: Start isEmpty. Operand 28673 states and 48678 transitions. [2019-09-08 04:40:16,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 04:40:16,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:16,617 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 04:40:16,617 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:16,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:16,618 INFO L82 PathProgramCache]: Analyzing trace with hash 907917074, now seen corresponding path program 1 times [2019-09-08 04:40:16,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:16,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:16,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:16,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:16,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:16,739 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:40:16,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:16,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:40:16,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:40:16,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:40:16,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:16,742 INFO L87 Difference]: Start difference. First operand 28673 states and 48678 transitions. Second operand 3 states. [2019-09-08 04:40:18,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:18,922 INFO L93 Difference]: Finished difference Result 81003 states and 137871 transitions. [2019-09-08 04:40:18,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:40:18,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-08 04:40:18,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:19,146 INFO L225 Difference]: With dead ends: 81003 [2019-09-08 04:40:19,146 INFO L226 Difference]: Without dead ends: 52490 [2019-09-08 04:40:19,248 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 04:40:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52490 states. [2019-09-08 04:40:21,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52490 to 52487. [2019-09-08 04:40:21,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52487 states. [2019-09-08 04:40:21,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52487 states to 52487 states and 88619 transitions. [2019-09-08 04:40:21,896 INFO L78 Accepts]: Start accepts. Automaton has 52487 states and 88619 transitions. Word has length 173 [2019-09-08 04:40:21,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:21,896 INFO L475 AbstractCegarLoop]: Abstraction has 52487 states and 88619 transitions. [2019-09-08 04:40:21,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:40:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 52487 states and 88619 transitions. [2019-09-08 04:40:21,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 04:40:21,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:21,945 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 04:40:21,945 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:21,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:21,945 INFO L82 PathProgramCache]: Analyzing trace with hash -592560731, now seen corresponding path program 1 times [2019-09-08 04:40:21,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:21,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:21,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:21,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:21,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:22,059 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:40:22,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:22,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:40:22,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:40:22,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:40:22,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:22,062 INFO L87 Difference]: Start difference. First operand 52487 states and 88619 transitions. Second operand 3 states. [2019-09-08 04:40:25,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:25,191 INFO L93 Difference]: Finished difference Result 150121 states and 254601 transitions. [2019-09-08 04:40:25,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:40:25,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-08 04:40:25,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:25,539 INFO L225 Difference]: With dead ends: 150121 [2019-09-08 04:40:25,539 INFO L226 Difference]: Without dead ends: 97804 [2019-09-08 04:40:25,716 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 04:40:25,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97804 states. [2019-09-08 04:40:32,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97804 to 97801. [2019-09-08 04:40:32,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97801 states. [2019-09-08 04:40:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97801 states to 97801 states and 164652 transitions. [2019-09-08 04:40:32,412 INFO L78 Accepts]: Start accepts. Automaton has 97801 states and 164652 transitions. Word has length 174 [2019-09-08 04:40:32,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:32,412 INFO L475 AbstractCegarLoop]: Abstraction has 97801 states and 164652 transitions. [2019-09-08 04:40:32,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:40:32,413 INFO L276 IsEmpty]: Start isEmpty. Operand 97801 states and 164652 transitions. [2019-09-08 04:40:32,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 04:40:32,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:32,490 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 04:40:32,490 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:32,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:32,490 INFO L82 PathProgramCache]: Analyzing trace with hash -399102190, now seen corresponding path program 1 times [2019-09-08 04:40:32,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:32,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:32,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:32,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:32,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:32,635 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:40:32,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:32,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:40:32,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:40:32,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:40:32,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:32,637 INFO L87 Difference]: Start difference. First operand 97801 states and 164652 transitions. Second operand 3 states. [2019-09-08 04:40:38,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:38,705 INFO L93 Difference]: Finished difference Result 185780 states and 310047 transitions. [2019-09-08 04:40:38,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:40:38,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-08 04:40:38,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:39,395 INFO L225 Difference]: With dead ends: 185780 [2019-09-08 04:40:39,396 INFO L226 Difference]: Without dead ends: 183808 [2019-09-08 04:40:39,503 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 04:40:39,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183808 states. [2019-09-08 04:40:49,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183808 to 183805. [2019-09-08 04:40:49,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183805 states. [2019-09-08 04:40:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183805 states to 183805 states and 304412 transitions. [2019-09-08 04:40:50,053 INFO L78 Accepts]: Start accepts. Automaton has 183805 states and 304412 transitions. Word has length 175 [2019-09-08 04:40:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:50,053 INFO L475 AbstractCegarLoop]: Abstraction has 183805 states and 304412 transitions. [2019-09-08 04:40:50,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:40:50,054 INFO L276 IsEmpty]: Start isEmpty. Operand 183805 states and 304412 transitions. [2019-09-08 04:40:50,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 04:40:50,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:50,114 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 04:40:50,114 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:50,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:50,115 INFO L82 PathProgramCache]: Analyzing trace with hash -515272283, now seen corresponding path program 1 times [2019-09-08 04:40:50,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:50,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:50,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:50,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:50,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:40:50,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:50,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:40:50,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:40:50,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:40:50,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:50,579 INFO L87 Difference]: Start difference. First operand 183805 states and 304412 transitions. Second operand 3 states. [2019-09-08 04:40:58,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:58,837 INFO L93 Difference]: Finished difference Result 186082 states and 307370 transitions. [2019-09-08 04:40:58,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:40:58,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 04:40:58,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:59,501 INFO L225 Difference]: With dead ends: 186082 [2019-09-08 04:40:59,502 INFO L226 Difference]: Without dead ends: 184160 [2019-09-08 04:40:59,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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 04:40:59,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184160 states. [2019-09-08 04:41:12,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184160 to 184144. [2019-09-08 04:41:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184144 states. [2019-09-08 04:41:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184144 states to 184144 states and 304801 transitions. [2019-09-08 04:41:13,268 INFO L78 Accepts]: Start accepts. Automaton has 184144 states and 304801 transitions. Word has length 176 [2019-09-08 04:41:13,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:41:13,269 INFO L475 AbstractCegarLoop]: Abstraction has 184144 states and 304801 transitions. [2019-09-08 04:41:13,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:41:13,269 INFO L276 IsEmpty]: Start isEmpty. Operand 184144 states and 304801 transitions. [2019-09-08 04:41:13,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-08 04:41:13,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:41:13,931 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:41:13,931 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:41:13,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:41:13,931 INFO L82 PathProgramCache]: Analyzing trace with hash -369454768, now seen corresponding path program 1 times [2019-09-08 04:41:13,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:41:13,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:41:13,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:41:13,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:41:13,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:41:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:41:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-08 04:41:14,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:41:14,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:41:14,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:41:14,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:41:14,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:41:14,120 INFO L87 Difference]: Start difference. First operand 184144 states and 304801 transitions. Second operand 5 states. [2019-09-08 04:41:23,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:41:23,358 INFO L93 Difference]: Finished difference Result 185248 states and 306168 transitions. [2019-09-08 04:41:23,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:41:23,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 290 [2019-09-08 04:41:23,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:41:24,123 INFO L225 Difference]: With dead ends: 185248 [2019-09-08 04:41:24,123 INFO L226 Difference]: Without dead ends: 183808 [2019-09-08 04:41:24,210 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 04:41:24,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183808 states. [2019-09-08 04:41:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183808 to 183800. [2019-09-08 04:41:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183800 states. [2019-09-08 04:41:32,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183800 states to 183800 states and 304330 transitions. [2019-09-08 04:41:32,818 INFO L78 Accepts]: Start accepts. Automaton has 183800 states and 304330 transitions. Word has length 290 [2019-09-08 04:41:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:41:32,819 INFO L475 AbstractCegarLoop]: Abstraction has 183800 states and 304330 transitions. [2019-09-08 04:41:32,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:41:32,819 INFO L276 IsEmpty]: Start isEmpty. Operand 183800 states and 304330 transitions. [2019-09-08 04:41:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-09-08 04:41:39,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:41:39,235 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:41:39,235 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:41:39,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:41:39,236 INFO L82 PathProgramCache]: Analyzing trace with hash -441670640, now seen corresponding path program 1 times [2019-09-08 04:41:39,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:41:39,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:41:39,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:41:39,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:41:39,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:41:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:41:39,485 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-08 04:41:39,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:41:39,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:41:39,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:41:39,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:41:39,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:41:39,487 INFO L87 Difference]: Start difference. First operand 183800 states and 304330 transitions. Second operand 11 states. [2019-09-08 04:41:49,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:41:49,877 INFO L93 Difference]: Finished difference Result 185007 states and 305829 transitions. [2019-09-08 04:41:49,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:41:49,877 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 291 [2019-09-08 04:41:49,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:41:50,358 INFO L225 Difference]: With dead ends: 185007 [2019-09-08 04:41:50,358 INFO L226 Difference]: Without dead ends: 184427 [2019-09-08 04:41:50,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:41:50,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184427 states. [2019-09-08 04:42:06,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184427 to 183807. [2019-09-08 04:42:06,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183807 states. [2019-09-08 04:42:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183807 states to 183807 states and 304311 transitions. [2019-09-08 04:42:07,063 INFO L78 Accepts]: Start accepts. Automaton has 183807 states and 304311 transitions. Word has length 291 [2019-09-08 04:42:07,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:42:07,063 INFO L475 AbstractCegarLoop]: Abstraction has 183807 states and 304311 transitions. [2019-09-08 04:42:07,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:42:07,063 INFO L276 IsEmpty]: Start isEmpty. Operand 183807 states and 304311 transitions. [2019-09-08 04:42:07,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-09-08 04:42:07,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:42:07,847 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:42:07,847 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:42:07,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:42:07,847 INFO L82 PathProgramCache]: Analyzing trace with hash 661304339, now seen corresponding path program 1 times [2019-09-08 04:42:07,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:42:07,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:42:07,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:42:07,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:42:07,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:42:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:42:08,071 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-08 04:42:08,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:42:08,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:42:08,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:42:08,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:42:08,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:42:08,073 INFO L87 Difference]: Start difference. First operand 183807 states and 304311 transitions. Second operand 7 states. [2019-09-08 04:42:19,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:42:19,905 INFO L93 Difference]: Finished difference Result 184900 states and 305668 transitions. [2019-09-08 04:42:19,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:42:19,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 309 [2019-09-08 04:42:19,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:42:20,441 INFO L225 Difference]: With dead ends: 184900 [2019-09-08 04:42:20,442 INFO L226 Difference]: Without dead ends: 183823 [2019-09-08 04:42:20,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:42:20,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183823 states. [2019-09-08 04:42:29,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183823 to 183823. [2019-09-08 04:42:29,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183823 states. [2019-09-08 04:42:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183823 states to 183823 states and 304327 transitions. [2019-09-08 04:42:29,965 INFO L78 Accepts]: Start accepts. Automaton has 183823 states and 304327 transitions. Word has length 309 [2019-09-08 04:42:29,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:42:29,966 INFO L475 AbstractCegarLoop]: Abstraction has 183823 states and 304327 transitions. [2019-09-08 04:42:29,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:42:29,966 INFO L276 IsEmpty]: Start isEmpty. Operand 183823 states and 304327 transitions. [2019-09-08 04:42:30,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 04:42:30,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:42:30,703 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:42:30,703 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:42:30,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:42:30,704 INFO L82 PathProgramCache]: Analyzing trace with hash -174961736, now seen corresponding path program 1 times [2019-09-08 04:42:30,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:42:30,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:42:30,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:42:30,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:42:30,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:42:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:42:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-08 04:42:30,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:42:30,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:42:30,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:42:30,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:42:30,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:42:30,968 INFO L87 Difference]: Start difference. First operand 183823 states and 304327 transitions. Second operand 11 states. [2019-09-08 04:42:42,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:42:42,417 INFO L93 Difference]: Finished difference Result 184490 states and 305192 transitions. [2019-09-08 04:42:42,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:42:42,418 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 310 [2019-09-08 04:42:42,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:42:42,910 INFO L225 Difference]: With dead ends: 184490 [2019-09-08 04:42:42,910 INFO L226 Difference]: Without dead ends: 183937 [2019-09-08 04:42:42,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:42:43,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183937 states. [2019-09-08 04:42:51,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183937 to 183925. [2019-09-08 04:42:51,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183925 states. [2019-09-08 04:42:52,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183925 states to 183925 states and 304483 transitions. [2019-09-08 04:42:52,098 INFO L78 Accepts]: Start accepts. Automaton has 183925 states and 304483 transitions. Word has length 310 [2019-09-08 04:42:52,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:42:52,099 INFO L475 AbstractCegarLoop]: Abstraction has 183925 states and 304483 transitions. [2019-09-08 04:42:52,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:42:52,099 INFO L276 IsEmpty]: Start isEmpty. Operand 183925 states and 304483 transitions. [2019-09-08 04:42:52,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-08 04:42:52,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:42:52,845 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:42:52,845 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:42:52,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:42:52,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1783768119, now seen corresponding path program 1 times [2019-09-08 04:42:52,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:42:52,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:42:52,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:42:52,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:42:52,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:42:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:42:53,058 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-08 04:42:53,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:42:53,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:42:53,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:42:53,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:42:53,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:42:53,060 INFO L87 Difference]: Start difference. First operand 183925 states and 304483 transitions. Second operand 7 states. [2019-09-08 04:43:13,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:43:13,192 INFO L93 Difference]: Finished difference Result 369828 states and 614530 transitions. [2019-09-08 04:43:13,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:43:13,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 311 [2019-09-08 04:43:13,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:43:14,497 INFO L225 Difference]: With dead ends: 369828 [2019-09-08 04:43:14,498 INFO L226 Difference]: Without dead ends: 368751 [2019-09-08 04:43:14,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:43:14,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368751 states. [2019-09-08 04:43:38,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368751 to 368739. [2019-09-08 04:43:38,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368739 states. [2019-09-08 04:43:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368739 states to 368739 states and 613178 transitions. [2019-09-08 04:43:48,086 INFO L78 Accepts]: Start accepts. Automaton has 368739 states and 613178 transitions. Word has length 311 [2019-09-08 04:43:48,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:43:48,087 INFO L475 AbstractCegarLoop]: Abstraction has 368739 states and 613178 transitions. [2019-09-08 04:43:48,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:43:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 368739 states and 613178 transitions. [2019-09-08 04:43:49,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 04:43:49,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:43:49,718 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:43:49,719 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:43:49,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:43:49,719 INFO L82 PathProgramCache]: Analyzing trace with hash -179175874, now seen corresponding path program 1 times [2019-09-08 04:43:49,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:43:49,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:43:49,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:43:49,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:43:49,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:43:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:43:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-08 04:43:49,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:43:49,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:43:49,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:43:49,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:43:49,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:43:49,967 INFO L87 Difference]: Start difference. First operand 368739 states and 613178 transitions. Second operand 11 states. [2019-09-08 04:44:09,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:44:09,444 INFO L93 Difference]: Finished difference Result 370026 states and 614870 transitions. [2019-09-08 04:44:09,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:44:09,444 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 312 [2019-09-08 04:44:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:44:10,549 INFO L225 Difference]: With dead ends: 370026 [2019-09-08 04:44:10,549 INFO L226 Difference]: Without dead ends: 368925 [2019-09-08 04:44:10,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:44:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368925 states. [2019-09-08 04:44:40,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368925 to 368901. [2019-09-08 04:44:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368901 states. [2019-09-08 04:44:49,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368901 states to 368901 states and 613438 transitions. [2019-09-08 04:44:49,457 INFO L78 Accepts]: Start accepts. Automaton has 368901 states and 613438 transitions. Word has length 312 [2019-09-08 04:44:49,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:44:49,457 INFO L475 AbstractCegarLoop]: Abstraction has 368901 states and 613438 transitions. [2019-09-08 04:44:49,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:44:49,458 INFO L276 IsEmpty]: Start isEmpty. Operand 368901 states and 613438 transitions. [2019-09-08 04:44:51,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-08 04:44:51,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:44:51,151 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:44:51,152 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:44:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:44:51,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1467076589, now seen corresponding path program 1 times [2019-09-08 04:44:51,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:44:51,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:44:51,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:44:51,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:44:51,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:44:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:44:51,342 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-08 04:44:51,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:44:51,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:44:51,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:44:51,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:44:51,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:44:51,344 INFO L87 Difference]: Start difference. First operand 368901 states and 613438 transitions. Second operand 7 states. [2019-09-08 04:45:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:45:33,135 INFO L93 Difference]: Finished difference Result 741953 states and 1238257 transitions. [2019-09-08 04:45:33,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:45:33,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 313 [2019-09-08 04:45:33,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:45:35,514 INFO L225 Difference]: With dead ends: 741953 [2019-09-08 04:45:35,515 INFO L226 Difference]: Without dead ends: 739804 [2019-09-08 04:45:35,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:45:36,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739804 states. [2019-09-08 04:46:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739804 to 739792. [2019-09-08 04:46:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739792 states. [2019-09-08 04:46:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739792 states to 739792 states and 1235568 transitions. [2019-09-08 04:46:44,761 INFO L78 Accepts]: Start accepts. Automaton has 739792 states and 1235568 transitions. Word has length 313 [2019-09-08 04:46:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:46:44,762 INFO L475 AbstractCegarLoop]: Abstraction has 739792 states and 1235568 transitions. [2019-09-08 04:46:44,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:46:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 739792 states and 1235568 transitions. [2019-09-08 04:46:48,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-08 04:46:48,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:46:48,455 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:46:48,455 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:46:48,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:46:48,455 INFO L82 PathProgramCache]: Analyzing trace with hash -772429582, now seen corresponding path program 1 times [2019-09-08 04:46:48,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:46:48,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:46:48,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:48,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:46:48,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:50,123 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-08 04:46:50,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:46:50,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:46:50,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:46:50,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:46:50,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:46:50,130 INFO L87 Difference]: Start difference. First operand 739792 states and 1235568 transitions. Second operand 11 states. [2019-09-08 04:47:30,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:47:30,515 INFO L93 Difference]: Finished difference Result 743457 states and 1240418 transitions. [2019-09-08 04:47:30,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:47:30,516 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 313 [2019-09-08 04:47:30,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:47:33,193 INFO L225 Difference]: With dead ends: 743457 [2019-09-08 04:47:33,193 INFO L226 Difference]: Without dead ends: 740164 [2019-09-08 04:47:33,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:47:33,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740164 states. [2019-09-08 04:48:45,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740164 to 740128. [2019-09-08 04:48:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740128 states. [2019-09-08 04:48:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740128 states to 740128 states and 1236106 transitions. [2019-09-08 04:48:48,618 INFO L78 Accepts]: Start accepts. Automaton has 740128 states and 1236106 transitions. Word has length 313 [2019-09-08 04:48:48,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:48:48,619 INFO L475 AbstractCegarLoop]: Abstraction has 740128 states and 1236106 transitions. [2019-09-08 04:48:48,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:48:48,619 INFO L276 IsEmpty]: Start isEmpty. Operand 740128 states and 1236106 transitions. [2019-09-08 04:48:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-08 04:48:54,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:48:54,046 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:48:54,046 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:48:54,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:48:54,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1021755763, now seen corresponding path program 1 times [2019-09-08 04:48:54,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:48:54,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:48:54,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:54,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:48:54,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:48:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-08 04:48:54,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:48:54,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:48:54,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:48:54,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:48:54,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:48:54,243 INFO L87 Difference]: Start difference. First operand 740128 states and 1236106 transitions. Second operand 9 states.