java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec6_product22.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:25:30,818 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:25:30,820 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:25:30,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:25:30,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:25:30,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:25:30,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:25:30,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:25:30,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:25:30,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:25:30,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:25:30,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:25:30,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:25:30,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:25:30,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:25:30,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:25:30,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:25:30,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:25:30,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:25:30,851 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:25:30,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:25:30,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:25:30,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:25:30,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:25:30,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:25:30,857 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:25:30,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:25:30,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:25:30,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:25:30,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:25:30,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:25:30,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:25:30,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:25:30,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:25:30,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:25:30,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:25:30,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:25:30,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:25:30,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:25:30,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:25:30,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:25:30,867 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 05:25:30,882 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:25:30,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:25:30,883 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:25:30,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:25:30,884 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:25:30,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:25:30,884 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:25:30,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:25:30,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:25:30,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:25:30,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:25:30,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:25:30,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:25:30,885 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:25:30,886 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:25:30,886 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:25:30,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:25:30,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:25:30,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:25:30,887 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:25:30,887 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:25:30,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:25:30,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:25:30,888 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:25:30,888 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:25:30,888 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:25:30,888 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:25:30,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:25:30,888 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:25:30,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:25:30,941 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:25:30,946 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:25:30,948 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:25:30,948 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:25:30,949 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec6_product22.cil.c [2019-09-08 05:25:31,030 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0075ac09/3656e63080d74dfc91f0418b0190b5aa/FLAG8d42caf60 [2019-09-08 05:25:31,739 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:25:31,740 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec6_product22.cil.c [2019-09-08 05:25:31,761 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0075ac09/3656e63080d74dfc91f0418b0190b5aa/FLAG8d42caf60 [2019-09-08 05:25:31,907 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0075ac09/3656e63080d74dfc91f0418b0190b5aa [2019-09-08 05:25:31,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:25:31,918 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:25:31,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:25:31,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:25:31,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:25:31,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:25:31" (1/1) ... [2019-09-08 05:25:31,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ebc8b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:31, skipping insertion in model container [2019-09-08 05:25:31,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:25:31" (1/1) ... [2019-09-08 05:25:31,934 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:25:32,003 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:25:32,736 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:25:32,754 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:25:32,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:25:33,001 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:25:33,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:33 WrapperNode [2019-09-08 05:25:33,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:25:33,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:25:33,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:25:33,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:25:33,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:33" (1/1) ... [2019-09-08 05:25:33,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:33" (1/1) ... [2019-09-08 05:25:33,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:33" (1/1) ... [2019-09-08 05:25:33,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:33" (1/1) ... [2019-09-08 05:25:33,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:33" (1/1) ... [2019-09-08 05:25:33,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:33" (1/1) ... [2019-09-08 05:25:33,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:33" (1/1) ... [2019-09-08 05:25:33,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:25:33,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:25:33,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:25:33,187 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:25:33,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:25:33,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:25:33,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:25:33,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:25:33,284 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:25:33,285 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:25:33,286 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:25:33,286 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:25:33,286 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:25:33,286 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:25:33,287 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:25:33,287 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:25:33,288 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:25:33,288 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:25:33,289 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:25:33,290 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:25:33,290 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:25:33,292 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:25:33,293 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:25:33,293 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:25:33,293 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:25:33,293 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:25:33,297 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:25:33,297 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:25:33,297 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:25:33,297 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:25:33,298 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:25:33,298 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:25:33,298 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:25:33,298 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:25:33,298 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:25:33,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:25:33,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:25:33,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:25:33,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:25:33,299 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:25:33,300 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-08 05:25:33,300 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-08 05:25:33,300 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:25:33,300 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:25:33,300 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:25:33,300 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:25:33,301 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:25:33,301 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:25:33,302 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:25:33,302 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:25:33,302 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:25:33,303 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:25:33,303 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:25:33,303 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:25:33,303 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:25:33,303 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:25:33,304 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:25:33,304 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:25:33,304 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:25:33,304 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:25:33,304 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:25:33,304 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:25:33,304 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:25:33,305 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:25:33,305 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:25:33,305 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:25:33,305 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:25:33,306 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:25:33,306 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:25:33,306 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:25:33,306 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:25:33,306 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:25:33,306 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:25:33,306 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:25:33,307 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:25:33,307 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:25:33,307 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:25:33,307 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:25:33,307 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:25:33,308 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:25:33,309 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:25:33,309 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:25:33,309 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:25:33,309 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:25:33,310 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:25:33,310 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:25:33,310 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:25:33,311 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:25:33,311 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:25:33,311 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:25:33,311 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:25:33,312 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:25:33,313 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 05:25:33,313 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 05:25:33,313 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:25:33,313 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:25:33,314 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:25:33,314 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:25:33,315 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 05:25:33,315 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AutoResponder [2019-09-08 05:25:33,315 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-08 05:25:33,315 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:25:33,315 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:25:33,316 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:25:33,316 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:25:33,316 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:25:33,316 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:25:33,316 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:25:33,316 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:25:33,316 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:25:33,317 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 05:25:33,317 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 05:25:33,317 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:25:33,317 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:25:33,317 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:25:33,318 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:25:33,318 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:25:33,318 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:25:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:25:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:25:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:25:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:25:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:25:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:25:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:25:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:25:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:25:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:25:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:25:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:25:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:25:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:25:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:25:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:25:33,323 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:25:33,323 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:25:33,323 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:25:33,324 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:25:33,324 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:25:33,324 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:25:33,324 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:25:33,324 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:25:33,325 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:25:33,325 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:25:33,326 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:25:33,330 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:25:33,330 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:25:33,331 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:25:33,331 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:25:33,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:25:33,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:25:33,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:25:33,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:25:33,338 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:25:33,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:25:33,339 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:25:33,339 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:25:33,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:25:33,340 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:25:33,340 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:25:33,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:25:33,341 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:25:33,341 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:25:33,341 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:25:33,341 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:25:33,342 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:25:33,342 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:25:33,342 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:25:33,342 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-08 05:25:33,342 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-08 05:25:33,343 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:25:33,343 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:25:33,343 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:25:33,343 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:25:33,343 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:25:33,343 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:25:33,343 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:25:33,344 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:25:33,344 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:25:33,344 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:25:33,344 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:25:33,344 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:25:33,344 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:25:33,344 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:25:33,344 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:25:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:25:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:25:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:25:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:25:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:25:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:25:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:25:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:25:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:25:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:25:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:25:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:25:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:25:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:25:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 05:25:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:25:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:25:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:25:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 05:25:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:25:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:25:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:25:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:25:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:25:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:25:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:25:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:25:33,349 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:25:33,349 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:25:33,349 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:25:33,349 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:25:33,349 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:25:33,349 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:25:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:25:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:25:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:25:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:25:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:25:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:25:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:25:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:25:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:25:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:25:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:25:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:25:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:25:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:25:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:25:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 05:25:33,353 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 05:25:33,353 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:25:33,353 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 05:25:33,353 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AutoResponder [2019-09-08 05:25:33,353 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-08 05:25:33,353 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:25:33,354 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:25:33,354 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:25:33,354 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:25:33,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:25:33,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:25:33,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:25:35,966 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:25:35,966 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:25:35,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:25:35 BoogieIcfgContainer [2019-09-08 05:25:35,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:25:35,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:25:35,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:25:35,973 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:25:35,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:25:31" (1/3) ... [2019-09-08 05:25:35,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6270be16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:25:35, skipping insertion in model container [2019-09-08 05:25:35,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:25:33" (2/3) ... [2019-09-08 05:25:35,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6270be16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:25:35, skipping insertion in model container [2019-09-08 05:25:35,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:25:35" (3/3) ... [2019-09-08 05:25:35,977 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec6_product22.cil.c [2019-09-08 05:25:35,987 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:25:36,001 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:25:36,019 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:25:36,066 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:25:36,067 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:25:36,067 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:25:36,067 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:25:36,067 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:25:36,067 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:25:36,067 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:25:36,067 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:25:36,068 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:25:36,108 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states. [2019-09-08 05:25:36,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 05:25:36,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:36,135 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:25:36,138 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:36,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:36,144 INFO L82 PathProgramCache]: Analyzing trace with hash 769070679, now seen corresponding path program 1 times [2019-09-08 05:25:36,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:36,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:36,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:36,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:36,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:36,720 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:25:36,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:36,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:25:36,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:25:36,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:25:36,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:25:36,746 INFO L87 Difference]: Start difference. First operand 516 states. Second operand 2 states. [2019-09-08 05:25:36,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:36,839 INFO L93 Difference]: Finished difference Result 763 states and 1004 transitions. [2019-09-08 05:25:36,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:25:36,841 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 176 [2019-09-08 05:25:36,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:36,883 INFO L225 Difference]: With dead ends: 763 [2019-09-08 05:25:36,885 INFO L226 Difference]: Without dead ends: 493 [2019-09-08 05:25:36,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:25:36,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-08 05:25:37,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-09-08 05:25:37,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-09-08 05:25:37,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 653 transitions. [2019-09-08 05:25:37,058 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 653 transitions. Word has length 176 [2019-09-08 05:25:37,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:37,062 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 653 transitions. [2019-09-08 05:25:37,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:25:37,063 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 653 transitions. [2019-09-08 05:25:37,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 05:25:37,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:37,076 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:25:37,076 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:37,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:37,077 INFO L82 PathProgramCache]: Analyzing trace with hash -688559635, now seen corresponding path program 1 times [2019-09-08 05:25:37,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:37,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:37,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:37,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:37,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:37,406 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:25:37,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:37,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:25:37,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:25:37,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:25:37,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:25:37,416 INFO L87 Difference]: Start difference. First operand 493 states and 653 transitions. Second operand 3 states. [2019-09-08 05:25:37,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:37,477 INFO L93 Difference]: Finished difference Result 746 states and 972 transitions. [2019-09-08 05:25:37,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:25:37,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-09-08 05:25:37,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:37,482 INFO L225 Difference]: With dead ends: 746 [2019-09-08 05:25:37,483 INFO L226 Difference]: Without dead ends: 496 [2019-09-08 05:25:37,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:25:37,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-09-08 05:25:37,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 495. [2019-09-08 05:25:37,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 05:25:37,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 655 transitions. [2019-09-08 05:25:37,517 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 655 transitions. Word has length 177 [2019-09-08 05:25:37,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:37,519 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 655 transitions. [2019-09-08 05:25:37,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:25:37,519 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 655 transitions. [2019-09-08 05:25:37,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 05:25:37,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:37,526 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:25:37,526 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:37,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:37,527 INFO L82 PathProgramCache]: Analyzing trace with hash -786901730, now seen corresponding path program 1 times [2019-09-08 05:25:37,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:37,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:37,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:37,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:37,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:25:37,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:37,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:25:37,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:25:37,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:25:37,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:25:37,805 INFO L87 Difference]: Start difference. First operand 495 states and 655 transitions. Second operand 3 states. [2019-09-08 05:25:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:37,845 INFO L93 Difference]: Finished difference Result 968 states and 1311 transitions. [2019-09-08 05:25:37,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:25:37,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-09-08 05:25:37,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:37,851 INFO L225 Difference]: With dead ends: 968 [2019-09-08 05:25:37,851 INFO L226 Difference]: Without dead ends: 538 [2019-09-08 05:25:37,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:25:37,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-09-08 05:25:37,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 537. [2019-09-08 05:25:37,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-08 05:25:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 727 transitions. [2019-09-08 05:25:37,882 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 727 transitions. Word has length 189 [2019-09-08 05:25:37,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:37,883 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 727 transitions. [2019-09-08 05:25:37,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:25:37,883 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 727 transitions. [2019-09-08 05:25:37,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 05:25:37,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:37,888 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:25:37,888 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:37,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:37,889 INFO L82 PathProgramCache]: Analyzing trace with hash 647973382, now seen corresponding path program 1 times [2019-09-08 05:25:37,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:37,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:37,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:37,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:37,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:25:38,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:38,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:25:38,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:25:38,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:25:38,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:25:38,034 INFO L87 Difference]: Start difference. First operand 537 states and 727 transitions. Second operand 3 states. [2019-09-08 05:25:38,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:38,069 INFO L93 Difference]: Finished difference Result 1091 states and 1522 transitions. [2019-09-08 05:25:38,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:25:38,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-09-08 05:25:38,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:38,075 INFO L225 Difference]: With dead ends: 1091 [2019-09-08 05:25:38,075 INFO L226 Difference]: Without dead ends: 619 [2019-09-08 05:25:38,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:25:38,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-09-08 05:25:38,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 618. [2019-09-08 05:25:38,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-08 05:25:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 865 transitions. [2019-09-08 05:25:38,109 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 865 transitions. Word has length 190 [2019-09-08 05:25:38,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:38,110 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 865 transitions. [2019-09-08 05:25:38,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:25:38,110 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 865 transitions. [2019-09-08 05:25:38,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 05:25:38,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:38,115 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:25:38,115 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:38,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:38,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1688592318, now seen corresponding path program 1 times [2019-09-08 05:25:38,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:38,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:38,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:38,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:38,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:25:38,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:38,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:25:38,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:25:38,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:25:38,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:25:38,329 INFO L87 Difference]: Start difference. First operand 618 states and 865 transitions. Second operand 3 states. [2019-09-08 05:25:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:38,368 INFO L93 Difference]: Finished difference Result 1328 states and 1926 transitions. [2019-09-08 05:25:38,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:25:38,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2019-09-08 05:25:38,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:38,374 INFO L225 Difference]: With dead ends: 1328 [2019-09-08 05:25:38,374 INFO L226 Difference]: Without dead ends: 775 [2019-09-08 05:25:38,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:25:38,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-09-08 05:25:38,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 774. [2019-09-08 05:25:38,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-09-08 05:25:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1129 transitions. [2019-09-08 05:25:38,412 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1129 transitions. Word has length 191 [2019-09-08 05:25:38,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:38,413 INFO L475 AbstractCegarLoop]: Abstraction has 774 states and 1129 transitions. [2019-09-08 05:25:38,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:25:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1129 transitions. [2019-09-08 05:25:38,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 05:25:38,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:38,418 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:25:38,419 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:38,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:38,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1410664810, now seen corresponding path program 1 times [2019-09-08 05:25:38,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:38,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:38,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:38,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:38,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:25:38,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:38,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:25:38,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:25:38,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:25:38,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:25:38,663 INFO L87 Difference]: Start difference. First operand 774 states and 1129 transitions. Second operand 11 states. [2019-09-08 05:25:44,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:44,146 INFO L93 Difference]: Finished difference Result 2730 states and 3704 transitions. [2019-09-08 05:25:44,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 05:25:44,146 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 193 [2019-09-08 05:25:44,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:44,178 INFO L225 Difference]: With dead ends: 2730 [2019-09-08 05:25:44,178 INFO L226 Difference]: Without dead ends: 2185 [2019-09-08 05:25:44,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-09-08 05:25:44,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2019-09-08 05:25:44,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2170. [2019-09-08 05:25:44,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-09-08 05:25:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2938 transitions. [2019-09-08 05:25:44,408 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2938 transitions. Word has length 193 [2019-09-08 05:25:44,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:44,412 INFO L475 AbstractCegarLoop]: Abstraction has 2170 states and 2938 transitions. [2019-09-08 05:25:44,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:25:44,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2938 transitions. [2019-09-08 05:25:44,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-08 05:25:44,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:44,460 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:25:44,461 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:44,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:44,462 INFO L82 PathProgramCache]: Analyzing trace with hash -2066868888, now seen corresponding path program 1 times [2019-09-08 05:25:44,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:44,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:44,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:44,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:44,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:44,953 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:25:44,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:44,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 05:25:44,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 05:25:44,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 05:25:44,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-08 05:25:44,956 INFO L87 Difference]: Start difference. First operand 2170 states and 2938 transitions. Second operand 16 states. [2019-09-08 05:25:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:45,455 INFO L93 Difference]: Finished difference Result 3602 states and 4793 transitions. [2019-09-08 05:25:45,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 05:25:45,456 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 194 [2019-09-08 05:25:45,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:45,470 INFO L225 Difference]: With dead ends: 3602 [2019-09-08 05:25:45,470 INFO L226 Difference]: Without dead ends: 1795 [2019-09-08 05:25:45,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:25:45,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2019-09-08 05:25:45,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1748. [2019-09-08 05:25:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1748 states. [2019-09-08 05:25:45,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2379 transitions. [2019-09-08 05:25:45,584 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2379 transitions. Word has length 194 [2019-09-08 05:25:45,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:45,588 INFO L475 AbstractCegarLoop]: Abstraction has 1748 states and 2379 transitions. [2019-09-08 05:25:45,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 05:25:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2379 transitions. [2019-09-08 05:25:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-08 05:25:45,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:45,594 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:25:45,594 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:45,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:45,595 INFO L82 PathProgramCache]: Analyzing trace with hash 470827017, now seen corresponding path program 1 times [2019-09-08 05:25:45,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:45,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:45,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:45,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:45,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:25:45,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:45,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:25:45,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:25:45,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:25:45,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:25:45,795 INFO L87 Difference]: Start difference. First operand 1748 states and 2379 transitions. Second operand 6 states. [2019-09-08 05:25:46,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:46,537 INFO L93 Difference]: Finished difference Result 4670 states and 6300 transitions. [2019-09-08 05:25:46,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:25:46,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2019-09-08 05:25:46,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:46,563 INFO L225 Difference]: With dead ends: 4670 [2019-09-08 05:25:46,564 INFO L226 Difference]: Without dead ends: 3487 [2019-09-08 05:25:46,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:25:46,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2019-09-08 05:25:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 3416. [2019-09-08 05:25:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3416 states. [2019-09-08 05:25:46,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 4702 transitions. [2019-09-08 05:25:46,760 INFO L78 Accepts]: Start accepts. Automaton has 3416 states and 4702 transitions. Word has length 203 [2019-09-08 05:25:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:46,761 INFO L475 AbstractCegarLoop]: Abstraction has 3416 states and 4702 transitions. [2019-09-08 05:25:46,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:25:46,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3416 states and 4702 transitions. [2019-09-08 05:25:46,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 05:25:46,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:46,777 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:25:46,778 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:46,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:46,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1952139048, now seen corresponding path program 1 times [2019-09-08 05:25:46,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:46,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:46,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:46,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:46,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:47,002 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:25:47,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:47,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:25:47,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:25:47,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:25:47,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:25:47,005 INFO L87 Difference]: Start difference. First operand 3416 states and 4702 transitions. Second operand 9 states. [2019-09-08 05:25:47,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:47,472 INFO L93 Difference]: Finished difference Result 5805 states and 7737 transitions. [2019-09-08 05:25:47,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:25:47,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 204 [2019-09-08 05:25:47,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:47,499 INFO L225 Difference]: With dead ends: 5805 [2019-09-08 05:25:47,499 INFO L226 Difference]: Without dead ends: 3434 [2019-09-08 05:25:47,511 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 05:25:47,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2019-09-08 05:25:47,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 3404. [2019-09-08 05:25:47,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3404 states. [2019-09-08 05:25:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3404 states to 3404 states and 4676 transitions. [2019-09-08 05:25:47,755 INFO L78 Accepts]: Start accepts. Automaton has 3404 states and 4676 transitions. Word has length 204 [2019-09-08 05:25:47,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:47,756 INFO L475 AbstractCegarLoop]: Abstraction has 3404 states and 4676 transitions. [2019-09-08 05:25:47,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:25:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 4676 transitions. [2019-09-08 05:25:47,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 05:25:47,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:47,765 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:25:47,765 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:47,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:47,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1365362929, now seen corresponding path program 1 times [2019-09-08 05:25:47,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:47,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:47,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:47,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:47,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:25:47,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:47,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:25:47,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:25:47,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:25:47,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:25:47,986 INFO L87 Difference]: Start difference. First operand 3404 states and 4676 transitions. Second operand 5 states. [2019-09-08 05:25:49,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:49,225 INFO L93 Difference]: Finished difference Result 11031 states and 14823 transitions. [2019-09-08 05:25:49,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 05:25:49,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 05:25:49,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:49,278 INFO L225 Difference]: With dead ends: 11031 [2019-09-08 05:25:49,278 INFO L226 Difference]: Without dead ends: 7882 [2019-09-08 05:25:49,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:25:49,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7882 states. [2019-09-08 05:25:49,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7882 to 7616. [2019-09-08 05:25:49,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7616 states. [2019-09-08 05:25:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7616 states to 7616 states and 10488 transitions. [2019-09-08 05:25:49,823 INFO L78 Accepts]: Start accepts. Automaton has 7616 states and 10488 transitions. Word has length 204 [2019-09-08 05:25:49,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:49,824 INFO L475 AbstractCegarLoop]: Abstraction has 7616 states and 10488 transitions. [2019-09-08 05:25:49,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:25:49,824 INFO L276 IsEmpty]: Start isEmpty. Operand 7616 states and 10488 transitions. [2019-09-08 05:25:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-08 05:25:49,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:49,847 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:25:49,848 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:49,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:49,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1182151362, now seen corresponding path program 1 times [2019-09-08 05:25:49,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:49,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:49,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:49,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:49,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:25:50,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:50,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:25:50,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:25:50,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:25:50,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:25:50,108 INFO L87 Difference]: Start difference. First operand 7616 states and 10488 transitions. Second operand 8 states. [2019-09-08 05:25:55,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:55,145 INFO L93 Difference]: Finished difference Result 23214 states and 33454 transitions. [2019-09-08 05:25:55,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:25:55,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 226 [2019-09-08 05:25:55,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:55,232 INFO L225 Difference]: With dead ends: 23214 [2019-09-08 05:25:55,232 INFO L226 Difference]: Without dead ends: 15663 [2019-09-08 05:25:55,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:25:55,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15663 states. [2019-09-08 05:25:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15663 to 9868. [2019-09-08 05:25:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9868 states. [2019-09-08 05:25:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9868 states to 9868 states and 14984 transitions. [2019-09-08 05:25:55,845 INFO L78 Accepts]: Start accepts. Automaton has 9868 states and 14984 transitions. Word has length 226 [2019-09-08 05:25:55,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:55,846 INFO L475 AbstractCegarLoop]: Abstraction has 9868 states and 14984 transitions. [2019-09-08 05:25:55,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:25:55,846 INFO L276 IsEmpty]: Start isEmpty. Operand 9868 states and 14984 transitions. [2019-09-08 05:25:55,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 05:25:55,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:55,886 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:25:55,887 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:55,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:55,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1582698216, now seen corresponding path program 1 times [2019-09-08 05:25:55,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:55,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:55,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:55,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:55,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:25:56,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:56,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:25:56,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:25:56,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:25:56,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:25:56,120 INFO L87 Difference]: Start difference. First operand 9868 states and 14984 transitions. Second operand 8 states. [2019-09-08 05:26:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:26:00,739 INFO L93 Difference]: Finished difference Result 30506 states and 49190 transitions. [2019-09-08 05:26:00,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:26:00,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 242 [2019-09-08 05:26:00,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:26:00,885 INFO L225 Difference]: With dead ends: 30506 [2019-09-08 05:26:00,886 INFO L226 Difference]: Without dead ends: 20703 [2019-09-08 05:26:00,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:26:00,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20703 states. [2019-09-08 05:26:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20703 to 14492. [2019-09-08 05:26:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14492 states. [2019-09-08 05:26:02,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14492 states to 14492 states and 24816 transitions. [2019-09-08 05:26:02,731 INFO L78 Accepts]: Start accepts. Automaton has 14492 states and 24816 transitions. Word has length 242 [2019-09-08 05:26:02,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:26:02,732 INFO L475 AbstractCegarLoop]: Abstraction has 14492 states and 24816 transitions. [2019-09-08 05:26:02,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:26:02,732 INFO L276 IsEmpty]: Start isEmpty. Operand 14492 states and 24816 transitions. [2019-09-08 05:26:02,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-08 05:26:02,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:26:02,848 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:26:02,849 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:26:02,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:26:02,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1158250007, now seen corresponding path program 1 times [2019-09-08 05:26:02,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:26:02,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:26:02,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:02,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:26:02,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:26:03,064 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:26:03,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:26:03,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:26:03,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:26:03,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:26:03,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:26:03,067 INFO L87 Difference]: Start difference. First operand 14492 states and 24816 transitions. Second operand 8 states. [2019-09-08 05:26:08,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:26:08,134 INFO L93 Difference]: Finished difference Result 45362 states and 83138 transitions. [2019-09-08 05:26:08,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:26:08,135 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 243 [2019-09-08 05:26:08,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:26:08,326 INFO L225 Difference]: With dead ends: 45362 [2019-09-08 05:26:08,327 INFO L226 Difference]: Without dead ends: 30935 [2019-09-08 05:26:08,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:26:08,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30935 states. [2019-09-08 05:26:09,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30935 to 23868. [2019-09-08 05:26:09,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23868 states. [2019-09-08 05:26:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23868 states to 23868 states and 46020 transitions. [2019-09-08 05:26:09,822 INFO L78 Accepts]: Start accepts. Automaton has 23868 states and 46020 transitions. Word has length 243 [2019-09-08 05:26:09,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:26:09,823 INFO L475 AbstractCegarLoop]: Abstraction has 23868 states and 46020 transitions. [2019-09-08 05:26:09,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:26:09,823 INFO L276 IsEmpty]: Start isEmpty. Operand 23868 states and 46020 transitions. [2019-09-08 05:26:10,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 05:26:10,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:26:10,215 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:26:10,215 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:26:10,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:26:10,216 INFO L82 PathProgramCache]: Analyzing trace with hash -825750448, now seen corresponding path program 1 times [2019-09-08 05:26:10,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:26:10,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:26:10,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:10,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:26:10,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:26:10,382 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 05:26:10,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:26:10,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:26:10,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:26:10,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:26:10,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:26:10,384 INFO L87 Difference]: Start difference. First operand 23868 states and 46020 transitions. Second operand 6 states. [2019-09-08 05:26:11,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:26:11,512 INFO L93 Difference]: Finished difference Result 47749 states and 92211 transitions. [2019-09-08 05:26:11,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:26:11,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-09-08 05:26:11,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:26:11,678 INFO L225 Difference]: With dead ends: 47749 [2019-09-08 05:26:11,679 INFO L226 Difference]: Without dead ends: 23946 [2019-09-08 05:26:13,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:26:13,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23946 states. [2019-09-08 05:26:14,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23946 to 23944. [2019-09-08 05:26:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23944 states. [2019-09-08 05:26:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23944 states to 23944 states and 46102 transitions. [2019-09-08 05:26:14,306 INFO L78 Accepts]: Start accepts. Automaton has 23944 states and 46102 transitions. Word has length 249 [2019-09-08 05:26:14,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:26:14,307 INFO L475 AbstractCegarLoop]: Abstraction has 23944 states and 46102 transitions. [2019-09-08 05:26:14,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:26:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 23944 states and 46102 transitions. [2019-09-08 05:26:14,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-08 05:26:14,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:26:14,402 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:26:14,403 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:26:14,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:26:14,403 INFO L82 PathProgramCache]: Analyzing trace with hash 262817270, now seen corresponding path program 1 times [2019-09-08 05:26:14,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:26:14,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:26:14,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:14,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:26:14,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:26:14,576 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:26:14,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:26:14,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:26:14,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:26:14,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:26:14,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:26:14,578 INFO L87 Difference]: Start difference. First operand 23944 states and 46102 transitions. Second operand 6 states. [2019-09-08 05:26:15,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:26:15,898 INFO L93 Difference]: Finished difference Result 47875 states and 92305 transitions. [2019-09-08 05:26:15,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:26:15,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 247 [2019-09-08 05:26:15,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:26:16,045 INFO L225 Difference]: With dead ends: 47875 [2019-09-08 05:26:16,045 INFO L226 Difference]: Without dead ends: 23944 [2019-09-08 05:26:16,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:26:16,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23944 states. [2019-09-08 05:26:18,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23944 to 23944. [2019-09-08 05:26:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23944 states. [2019-09-08 05:26:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23944 states to 23944 states and 46070 transitions. [2019-09-08 05:26:18,986 INFO L78 Accepts]: Start accepts. Automaton has 23944 states and 46070 transitions. Word has length 247 [2019-09-08 05:26:18,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:26:18,986 INFO L475 AbstractCegarLoop]: Abstraction has 23944 states and 46070 transitions. [2019-09-08 05:26:18,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:26:18,987 INFO L276 IsEmpty]: Start isEmpty. Operand 23944 states and 46070 transitions. [2019-09-08 05:26:19,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-08 05:26:19,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:26:19,059 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:26:19,060 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:26:19,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:26:19,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1193907306, now seen corresponding path program 1 times [2019-09-08 05:26:19,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:26:19,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:26:19,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:19,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:26:19,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:26:19,202 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:26:19,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:26:19,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:26:19,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:26:19,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:26:19,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:26:19,204 INFO L87 Difference]: Start difference. First operand 23944 states and 46070 transitions. Second operand 3 states. [2019-09-08 05:26:20,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:26:20,815 INFO L93 Difference]: Finished difference Result 57415 states and 115605 transitions. [2019-09-08 05:26:20,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:26:20,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-09-08 05:26:20,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:26:20,999 INFO L225 Difference]: With dead ends: 57415 [2019-09-08 05:26:20,999 INFO L226 Difference]: Without dead ends: 33548 [2019-09-08 05:26:21,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:26:21,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33548 states. [2019-09-08 05:26:22,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33548 to 33544. [2019-09-08 05:26:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33544 states. [2019-09-08 05:26:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33544 states to 33544 states and 69366 transitions. [2019-09-08 05:26:25,049 INFO L78 Accepts]: Start accepts. Automaton has 33544 states and 69366 transitions. Word has length 233 [2019-09-08 05:26:25,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:26:25,050 INFO L475 AbstractCegarLoop]: Abstraction has 33544 states and 69366 transitions. [2019-09-08 05:26:25,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:26:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 33544 states and 69366 transitions. [2019-09-08 05:26:25,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 05:26:25,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:26:25,179 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:26:25,180 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:26:25,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:26:25,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1810822386, now seen corresponding path program 1 times [2019-09-08 05:26:25,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:26:25,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:26:25,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:25,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:26:25,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:26:25,376 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-08 05:26:25,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:26:25,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:26:25,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:26:25,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:26:25,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:26:25,378 INFO L87 Difference]: Start difference. First operand 33544 states and 69366 transitions. Second operand 6 states. [2019-09-08 05:26:27,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:26:27,009 INFO L93 Difference]: Finished difference Result 67131 states and 140669 transitions. [2019-09-08 05:26:27,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:26:27,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 250 [2019-09-08 05:26:27,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:26:27,180 INFO L225 Difference]: With dead ends: 67131 [2019-09-08 05:26:27,180 INFO L226 Difference]: Without dead ends: 33664 [2019-09-08 05:26:27,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:26:27,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33664 states. [2019-09-08 05:26:28,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33664 to 33664. [2019-09-08 05:26:28,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33664 states. [2019-09-08 05:26:29,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33664 states to 33664 states and 68928 transitions. [2019-09-08 05:26:29,106 INFO L78 Accepts]: Start accepts. Automaton has 33664 states and 68928 transitions. Word has length 250 [2019-09-08 05:26:29,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:26:29,107 INFO L475 AbstractCegarLoop]: Abstraction has 33664 states and 68928 transitions. [2019-09-08 05:26:29,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:26:29,108 INFO L276 IsEmpty]: Start isEmpty. Operand 33664 states and 68928 transitions. [2019-09-08 05:26:29,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 05:26:29,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:26:29,233 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:26:29,233 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:26:29,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:26:29,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1073530669, now seen corresponding path program 1 times [2019-09-08 05:26:29,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:26:29,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:26:29,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:29,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:26:29,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:26:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:26:29,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:26:29,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:26:29,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:26:29,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:26:29,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:26:29,409 INFO L87 Difference]: Start difference. First operand 33664 states and 68928 transitions. Second operand 6 states. [2019-09-08 05:26:31,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:26:31,224 INFO L93 Difference]: Finished difference Result 67265 states and 146998 transitions. [2019-09-08 05:26:31,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:26:31,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 250 [2019-09-08 05:26:31,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:26:31,364 INFO L225 Difference]: With dead ends: 67265 [2019-09-08 05:26:31,364 INFO L226 Difference]: Without dead ends: 33678 [2019-09-08 05:26:31,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:26:31,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33678 states. [2019-09-08 05:26:34,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33678 to 33676. [2019-09-08 05:26:34,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33676 states. [2019-09-08 05:26:34,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33676 states to 33676 states and 64011 transitions. [2019-09-08 05:26:34,887 INFO L78 Accepts]: Start accepts. Automaton has 33676 states and 64011 transitions. Word has length 250 [2019-09-08 05:26:34,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:26:34,888 INFO L475 AbstractCegarLoop]: Abstraction has 33676 states and 64011 transitions. [2019-09-08 05:26:34,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:26:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 33676 states and 64011 transitions. [2019-09-08 05:26:34,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-08 05:26:34,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:26:34,981 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:26:34,981 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:26:34,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:26:34,982 INFO L82 PathProgramCache]: Analyzing trace with hash 642374617, now seen corresponding path program 1 times [2019-09-08 05:26:34,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:26:34,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:26:34,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:34,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:26:34,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:26:35,334 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-08 05:26:35,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:26:35,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 05:26:35,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 05:26:35,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 05:26:35,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:26:35,336 INFO L87 Difference]: Start difference. First operand 33676 states and 64011 transitions. Second operand 22 states. [2019-09-08 05:26:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:26:53,647 INFO L93 Difference]: Finished difference Result 66692 states and 119632 transitions. [2019-09-08 05:26:53,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 05:26:53,647 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 251 [2019-09-08 05:26:53,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:26:53,904 INFO L225 Difference]: With dead ends: 66692 [2019-09-08 05:26:53,905 INFO L226 Difference]: Without dead ends: 63761 [2019-09-08 05:26:53,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=483, Invalid=4209, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 05:26:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63761 states. [2019-09-08 05:26:57,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63761 to 62862. [2019-09-08 05:26:57,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62862 states. [2019-09-08 05:26:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62862 states to 62862 states and 114494 transitions. [2019-09-08 05:26:57,283 INFO L78 Accepts]: Start accepts. Automaton has 62862 states and 114494 transitions. Word has length 251 [2019-09-08 05:26:57,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:26:57,284 INFO L475 AbstractCegarLoop]: Abstraction has 62862 states and 114494 transitions. [2019-09-08 05:26:57,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 05:26:57,284 INFO L276 IsEmpty]: Start isEmpty. Operand 62862 states and 114494 transitions. [2019-09-08 05:26:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-08 05:26:57,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:26:57,603 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:26:57,603 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:26:57,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:26:57,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1432242059, now seen corresponding path program 1 times [2019-09-08 05:26:57,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:26:57,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:26:57,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:57,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:26:57,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:26:57,931 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:26:57,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:26:57,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:26:57,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:26:57,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:26:57,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:26:57,934 INFO L87 Difference]: Start difference. First operand 62862 states and 114494 transitions. Second operand 18 states. [2019-09-08 05:27:14,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:27:14,836 INFO L93 Difference]: Finished difference Result 80801 states and 138371 transitions. [2019-09-08 05:27:14,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 05:27:14,837 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 234 [2019-09-08 05:27:14,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:27:15,168 INFO L225 Difference]: With dead ends: 80801 [2019-09-08 05:27:15,169 INFO L226 Difference]: Without dead ends: 64999 [2019-09-08 05:27:15,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=423, Invalid=3483, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 05:27:15,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64999 states. [2019-09-08 05:27:18,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64999 to 64086. [2019-09-08 05:27:18,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64086 states. [2019-09-08 05:27:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64086 states to 64086 states and 116430 transitions. [2019-09-08 05:27:18,744 INFO L78 Accepts]: Start accepts. Automaton has 64086 states and 116430 transitions. Word has length 234 [2019-09-08 05:27:18,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:27:18,745 INFO L475 AbstractCegarLoop]: Abstraction has 64086 states and 116430 transitions. [2019-09-08 05:27:18,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:27:18,745 INFO L276 IsEmpty]: Start isEmpty. Operand 64086 states and 116430 transitions. [2019-09-08 05:27:19,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 05:27:19,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:27:19,007 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:27:19,007 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:27:19,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:27:19,007 INFO L82 PathProgramCache]: Analyzing trace with hash -916155089, now seen corresponding path program 1 times [2019-09-08 05:27:19,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:27:19,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:27:19,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:19,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:27:19,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:27:19,155 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:27:19,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:27:19,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:27:19,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:27:19,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:27:19,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:27:19,157 INFO L87 Difference]: Start difference. First operand 64086 states and 116430 transitions. Second operand 5 states. [2019-09-08 05:27:22,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:27:22,809 INFO L93 Difference]: Finished difference Result 78504 states and 134980 transitions. [2019-09-08 05:27:22,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:27:22,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-08 05:27:22,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:27:23,101 INFO L225 Difference]: With dead ends: 78504 [2019-09-08 05:27:23,101 INFO L226 Difference]: Without dead ends: 56969 [2019-09-08 05:27:23,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:27:23,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56969 states. [2019-09-08 05:27:25,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56969 to 55457. [2019-09-08 05:27:25,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55457 states. [2019-09-08 05:27:25,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55457 states to 55457 states and 104732 transitions. [2019-09-08 05:27:25,984 INFO L78 Accepts]: Start accepts. Automaton has 55457 states and 104732 transitions. Word has length 237 [2019-09-08 05:27:25,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:27:25,984 INFO L475 AbstractCegarLoop]: Abstraction has 55457 states and 104732 transitions. [2019-09-08 05:27:25,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:27:25,985 INFO L276 IsEmpty]: Start isEmpty. Operand 55457 states and 104732 transitions. [2019-09-08 05:27:26,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-08 05:27:26,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:27:26,210 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:27:26,210 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:27:26,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:27:26,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1269843155, now seen corresponding path program 1 times [2019-09-08 05:27:26,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:27:26,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:27:26,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:26,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:27:26,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:27:26,889 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 05:27:26,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:27:26,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 05:27:26,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 05:27:26,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 05:27:26,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 05:27:26,891 INFO L87 Difference]: Start difference. First operand 55457 states and 104732 transitions. Second operand 14 states. [2019-09-08 05:27:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:27:28,650 INFO L93 Difference]: Finished difference Result 68043 states and 121064 transitions. [2019-09-08 05:27:28,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:27:28,652 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 252 [2019-09-08 05:27:28,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:27:28,909 INFO L225 Difference]: With dead ends: 68043 [2019-09-08 05:27:28,909 INFO L226 Difference]: Without dead ends: 55121 [2019-09-08 05:27:28,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:27:28,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55121 states. [2019-09-08 05:27:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55121 to 55001. [2019-09-08 05:27:31,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55001 states. [2019-09-08 05:27:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55001 states to 55001 states and 103958 transitions. [2019-09-08 05:27:35,036 INFO L78 Accepts]: Start accepts. Automaton has 55001 states and 103958 transitions. Word has length 252 [2019-09-08 05:27:35,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:27:35,037 INFO L475 AbstractCegarLoop]: Abstraction has 55001 states and 103958 transitions. [2019-09-08 05:27:35,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 05:27:35,037 INFO L276 IsEmpty]: Start isEmpty. Operand 55001 states and 103958 transitions. [2019-09-08 05:27:35,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 05:27:35,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:27:35,192 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:27:35,192 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:27:35,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:27:35,193 INFO L82 PathProgramCache]: Analyzing trace with hash -284436396, now seen corresponding path program 1 times [2019-09-08 05:27:35,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:27:35,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:27:35,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:35,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:27:35,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:27:35,320 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:27:35,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:27:35,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:27:35,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:27:35,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:27:35,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:27:35,322 INFO L87 Difference]: Start difference. First operand 55001 states and 103958 transitions. Second operand 5 states. [2019-09-08 05:27:36,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:27:36,775 INFO L93 Difference]: Finished difference Result 61219 states and 111904 transitions. [2019-09-08 05:27:36,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:27:36,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 250 [2019-09-08 05:27:36,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:27:36,984 INFO L225 Difference]: With dead ends: 61219 [2019-09-08 05:27:36,984 INFO L226 Difference]: Without dead ends: 55000 [2019-09-08 05:27:37,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:27:37,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55000 states. [2019-09-08 05:27:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55000 to 54734. [2019-09-08 05:27:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54734 states. [2019-09-08 05:27:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54734 states to 54734 states and 103538 transitions. [2019-09-08 05:27:40,102 INFO L78 Accepts]: Start accepts. Automaton has 54734 states and 103538 transitions. Word has length 250 [2019-09-08 05:27:40,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:27:40,103 INFO L475 AbstractCegarLoop]: Abstraction has 54734 states and 103538 transitions. [2019-09-08 05:27:40,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:27:40,103 INFO L276 IsEmpty]: Start isEmpty. Operand 54734 states and 103538 transitions. [2019-09-08 05:27:40,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-08 05:27:40,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:27:40,298 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:27:40,298 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:27:40,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:27:40,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2045774121, now seen corresponding path program 1 times [2019-09-08 05:27:40,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:27:40,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:27:40,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:40,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:27:40,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:27:40,660 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:27:40,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:27:40,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:27:40,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:27:40,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:27:40,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:27:40,663 INFO L87 Difference]: Start difference. First operand 54734 states and 103538 transitions. Second operand 18 states. [2019-09-08 05:27:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:27:54,673 INFO L93 Difference]: Finished difference Result 58779 states and 108730 transitions. [2019-09-08 05:27:54,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 05:27:54,674 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 251 [2019-09-08 05:27:54,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:27:54,941 INFO L225 Difference]: With dead ends: 58779 [2019-09-08 05:27:54,941 INFO L226 Difference]: Without dead ends: 55218 [2019-09-08 05:27:54,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=312, Invalid=2138, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 05:27:55,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55218 states. [2019-09-08 05:27:57,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55218 to 54734. [2019-09-08 05:27:57,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54734 states. [2019-09-08 05:27:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54734 states to 54734 states and 103538 transitions. [2019-09-08 05:27:57,696 INFO L78 Accepts]: Start accepts. Automaton has 54734 states and 103538 transitions. Word has length 251 [2019-09-08 05:27:57,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:27:57,697 INFO L475 AbstractCegarLoop]: Abstraction has 54734 states and 103538 transitions. [2019-09-08 05:27:57,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:27:57,697 INFO L276 IsEmpty]: Start isEmpty. Operand 54734 states and 103538 transitions. [2019-09-08 05:27:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-08 05:27:57,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:27:57,866 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:27:57,867 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:27:57,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:27:57,867 INFO L82 PathProgramCache]: Analyzing trace with hash -150551426, now seen corresponding path program 1 times [2019-09-08 05:27:57,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:27:57,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:27:57,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:57,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:27:57,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:27:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-08 05:27:58,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:27:58,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:27:58,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:27:58,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:27:58,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:27:58,016 INFO L87 Difference]: Start difference. First operand 54734 states and 103538 transitions. Second operand 6 states. [2019-09-08 05:28:00,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:28:00,625 INFO L93 Difference]: Finished difference Result 109559 states and 209298 transitions. [2019-09-08 05:28:00,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:28:00,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-09-08 05:28:00,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:28:00,864 INFO L225 Difference]: With dead ends: 109559 [2019-09-08 05:28:00,865 INFO L226 Difference]: Without dead ends: 54914 [2019-09-08 05:28:01,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:28:01,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54914 states. [2019-09-08 05:28:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54914 to 54914. [2019-09-08 05:28:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54914 states. [2019-09-08 05:28:07,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54914 states to 54914 states and 103319 transitions. [2019-09-08 05:28:07,308 INFO L78 Accepts]: Start accepts. Automaton has 54914 states and 103319 transitions. Word has length 253 [2019-09-08 05:28:07,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:28:07,309 INFO L475 AbstractCegarLoop]: Abstraction has 54914 states and 103319 transitions. [2019-09-08 05:28:07,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:28:07,309 INFO L276 IsEmpty]: Start isEmpty. Operand 54914 states and 103319 transitions. [2019-09-08 05:28:07,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-08 05:28:07,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:28:07,495 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:28:07,495 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:28:07,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:28:07,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1121042107, now seen corresponding path program 1 times [2019-09-08 05:28:07,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:28:07,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:28:07,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:07,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:28:07,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:28:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:28:07,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:28:07,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:28:07,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:28:07,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:28:07,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:28:07,640 INFO L87 Difference]: Start difference. First operand 54914 states and 103319 transitions. Second operand 6 states. [2019-09-08 05:28:10,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:28:10,181 INFO L93 Difference]: Finished difference Result 109739 states and 215748 transitions. [2019-09-08 05:28:10,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:28:10,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-09-08 05:28:10,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:28:10,431 INFO L225 Difference]: With dead ends: 109739 [2019-09-08 05:28:10,431 INFO L226 Difference]: Without dead ends: 54914 [2019-09-08 05:28:10,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:28:10,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54914 states. [2019-09-08 05:28:13,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54914 to 54914. [2019-09-08 05:28:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54914 states. [2019-09-08 05:28:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54914 states to 54914 states and 98225 transitions. [2019-09-08 05:28:13,476 INFO L78 Accepts]: Start accepts. Automaton has 54914 states and 98225 transitions. Word has length 253 [2019-09-08 05:28:13,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:28:13,477 INFO L475 AbstractCegarLoop]: Abstraction has 54914 states and 98225 transitions. [2019-09-08 05:28:13,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:28:13,477 INFO L276 IsEmpty]: Start isEmpty. Operand 54914 states and 98225 transitions. [2019-09-08 05:28:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-08 05:28:13,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:28:13,720 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:28:13,720 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:28:13,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:28:13,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1760619666, now seen corresponding path program 1 times [2019-09-08 05:28:13,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:28:13,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:28:13,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:13,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:28:13,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:28:13,947 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-08 05:28:13,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:28:13,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:28:13,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:28:13,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:28:13,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:28:13,949 INFO L87 Difference]: Start difference. First operand 54914 states and 98225 transitions. Second operand 11 states. [2019-09-08 05:28:18,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:28:18,305 INFO L93 Difference]: Finished difference Result 71151 states and 119188 transitions. [2019-09-08 05:28:18,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 05:28:18,305 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 277 [2019-09-08 05:28:18,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:28:18,586 INFO L225 Difference]: With dead ends: 71151 [2019-09-08 05:28:18,586 INFO L226 Difference]: Without dead ends: 65261 [2019-09-08 05:28:18,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:28:18,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65261 states. [2019-09-08 05:28:21,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65261 to 64581. [2019-09-08 05:28:21,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64581 states. [2019-09-08 05:28:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64581 states to 64581 states and 110869 transitions. [2019-09-08 05:28:21,663 INFO L78 Accepts]: Start accepts. Automaton has 64581 states and 110869 transitions. Word has length 277 [2019-09-08 05:28:21,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:28:21,664 INFO L475 AbstractCegarLoop]: Abstraction has 64581 states and 110869 transitions. [2019-09-08 05:28:21,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:28:21,664 INFO L276 IsEmpty]: Start isEmpty. Operand 64581 states and 110869 transitions. [2019-09-08 05:28:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 05:28:21,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:28:21,835 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:28:21,836 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:28:21,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:28:21,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1066859648, now seen corresponding path program 1 times [2019-09-08 05:28:21,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:28:21,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:28:21,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:21,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:28:21,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:28:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 05:28:22,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:28:22,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 05:28:22,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:28:22,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:28:22,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:28:22,013 INFO L87 Difference]: Start difference. First operand 64581 states and 110869 transitions. Second operand 10 states. [2019-09-08 05:28:24,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:28:24,258 INFO L93 Difference]: Finished difference Result 79818 states and 130257 transitions. [2019-09-08 05:28:24,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:28:24,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 262 [2019-09-08 05:28:24,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:28:24,502 INFO L225 Difference]: With dead ends: 79818 [2019-09-08 05:28:24,503 INFO L226 Difference]: Without dead ends: 64203 [2019-09-08 05:28:24,555 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 05:28:24,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64203 states. [2019-09-08 05:28:30,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64203 to 64137. [2019-09-08 05:28:30,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64137 states. [2019-09-08 05:28:30,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64137 states to 64137 states and 110065 transitions. [2019-09-08 05:28:30,612 INFO L78 Accepts]: Start accepts. Automaton has 64137 states and 110065 transitions. Word has length 262 [2019-09-08 05:28:30,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:28:30,613 INFO L475 AbstractCegarLoop]: Abstraction has 64137 states and 110065 transitions. [2019-09-08 05:28:30,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:28:30,613 INFO L276 IsEmpty]: Start isEmpty. Operand 64137 states and 110065 transitions. [2019-09-08 05:28:30,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-08 05:28:30,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:28:30,793 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:28:30,793 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:28:30,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:28:30,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1392592172, now seen corresponding path program 1 times [2019-09-08 05:28:30,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:28:30,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:28:30,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:30,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:28:30,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:28:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 05:28:30,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:28:30,960 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:28:30,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:28:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:28:31,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 2983 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:28:31,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:28:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 05:28:31,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:28:31,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2019-09-08 05:28:31,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:28:31,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:28:31,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:28:31,733 INFO L87 Difference]: Start difference. First operand 64137 states and 110065 transitions. Second operand 13 states. [2019-09-08 05:28:38,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:28:38,032 INFO L93 Difference]: Finished difference Result 128222 states and 220068 transitions. [2019-09-08 05:28:38,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:28:38,033 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 260 [2019-09-08 05:28:38,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:28:38,494 INFO L225 Difference]: With dead ends: 128222 [2019-09-08 05:28:38,494 INFO L226 Difference]: Without dead ends: 64141 [2019-09-08 05:28:38,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 256 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 05:28:38,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64141 states. [2019-09-08 05:28:44,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64141 to 64137. [2019-09-08 05:28:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64137 states. [2019-09-08 05:28:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64137 states to 64137 states and 110063 transitions. [2019-09-08 05:28:44,226 INFO L78 Accepts]: Start accepts. Automaton has 64137 states and 110063 transitions. Word has length 260 [2019-09-08 05:28:44,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:28:44,227 INFO L475 AbstractCegarLoop]: Abstraction has 64137 states and 110063 transitions. [2019-09-08 05:28:44,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:28:44,227 INFO L276 IsEmpty]: Start isEmpty. Operand 64137 states and 110063 transitions. [2019-09-08 05:28:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 05:28:44,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:28:44,687 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:28:44,687 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:28:44,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:28:44,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1811870001, now seen corresponding path program 1 times [2019-09-08 05:28:44,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:28:44,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:28:44,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:44,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:28:44,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:28:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:28:44,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:28:44,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:28:44,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:28:44,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:28:44,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:28:44,940 INFO L87 Difference]: Start difference. First operand 64137 states and 110063 transitions. Second operand 7 states. [2019-09-08 05:28:47,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:28:47,749 INFO L93 Difference]: Finished difference Result 128196 states and 220033 transitions. [2019-09-08 05:28:47,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:28:47,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 245 [2019-09-08 05:28:47,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:28:48,198 INFO L225 Difference]: With dead ends: 128196 [2019-09-08 05:28:48,199 INFO L226 Difference]: Without dead ends: 64139 [2019-09-08 05:28:48,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:28:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64139 states. [2019-09-08 05:28:52,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64139 to 64137. [2019-09-08 05:28:52,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64137 states. [2019-09-08 05:28:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64137 states to 64137 states and 110062 transitions. [2019-09-08 05:28:53,007 INFO L78 Accepts]: Start accepts. Automaton has 64137 states and 110062 transitions. Word has length 245 [2019-09-08 05:28:53,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:28:53,007 INFO L475 AbstractCegarLoop]: Abstraction has 64137 states and 110062 transitions. [2019-09-08 05:28:53,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:28:53,007 INFO L276 IsEmpty]: Start isEmpty. Operand 64137 states and 110062 transitions. [2019-09-08 05:28:53,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 05:28:53,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:28:53,181 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:28:53,182 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:28:53,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:28:53,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1910671096, now seen corresponding path program 1 times [2019-09-08 05:28:53,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:28:53,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:28:53,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:53,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:28:53,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:28:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 05:28:53,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:28:53,529 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:28:53,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:28:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:28:54,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 2994 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:28:54,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:28:54,509 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 05:28:54,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:28:54,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2019-09-08 05:28:54,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:28:54,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:28:54,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:28:54,530 INFO L87 Difference]: Start difference. First operand 64137 states and 110062 transitions. Second operand 18 states. [2019-09-08 05:29:12,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:29:12,241 INFO L93 Difference]: Finished difference Result 223196 states and 399763 transitions. [2019-09-08 05:29:12,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 05:29:12,241 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 265 [2019-09-08 05:29:12,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:29:13,042 INFO L225 Difference]: With dead ends: 223196 [2019-09-08 05:29:13,043 INFO L226 Difference]: Without dead ends: 159127 [2019-09-08 05:29:13,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=345, Invalid=2105, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 05:29:13,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159127 states. [2019-09-08 05:29:25,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159127 to 128877. [2019-09-08 05:29:25,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128877 states. [2019-09-08 05:29:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128877 states to 128877 states and 224078 transitions. [2019-09-08 05:29:26,399 INFO L78 Accepts]: Start accepts. Automaton has 128877 states and 224078 transitions. Word has length 265 [2019-09-08 05:29:26,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:29:26,400 INFO L475 AbstractCegarLoop]: Abstraction has 128877 states and 224078 transitions. [2019-09-08 05:29:26,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:29:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 128877 states and 224078 transitions. [2019-09-08 05:29:26,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-08 05:29:26,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:29:26,758 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:29:26,758 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:29:26,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:29:26,758 INFO L82 PathProgramCache]: Analyzing trace with hash -161011836, now seen corresponding path program 1 times [2019-09-08 05:29:26,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:29:26,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:29:26,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:29:26,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:29:26,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:29:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:29:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 05:29:26,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:29:26,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:29:26,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:29:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:29:27,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 3050 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:29:27,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:29:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:29:27,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:29:27,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2019-09-08 05:29:27,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:29:27,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:29:27,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:29:27,638 INFO L87 Difference]: Start difference. First operand 128877 states and 224078 transitions. Second operand 13 states. [2019-09-08 05:29:34,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:29:34,283 INFO L93 Difference]: Finished difference Result 257936 states and 448372 transitions. [2019-09-08 05:29:34,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:29:34,284 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 282 [2019-09-08 05:29:34,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:29:35,198 INFO L225 Difference]: With dead ends: 257936 [2019-09-08 05:29:35,198 INFO L226 Difference]: Without dead ends: 129171 [2019-09-08 05:29:35,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:29:35,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129171 states. [2019-09-08 05:29:46,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129171 to 128881. [2019-09-08 05:29:46,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128881 states. [2019-09-08 05:29:47,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128881 states to 128881 states and 224081 transitions. [2019-09-08 05:29:47,508 INFO L78 Accepts]: Start accepts. Automaton has 128881 states and 224081 transitions. Word has length 282 [2019-09-08 05:29:47,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:29:47,509 INFO L475 AbstractCegarLoop]: Abstraction has 128881 states and 224081 transitions. [2019-09-08 05:29:47,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:29:47,509 INFO L276 IsEmpty]: Start isEmpty. Operand 128881 states and 224081 transitions. [2019-09-08 05:29:47,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-08 05:29:47,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:29:47,876 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:29:47,877 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:29:47,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:29:47,877 INFO L82 PathProgramCache]: Analyzing trace with hash 518878573, now seen corresponding path program 1 times [2019-09-08 05:29:47,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:29:47,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:29:47,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:29:47,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:29:47,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:29:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:29:48,149 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:29:48,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:29:48,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:29:48,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:29:48,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:29:48,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:29:48,153 INFO L87 Difference]: Start difference. First operand 128881 states and 224081 transitions. Second operand 9 states. [2019-09-08 05:29:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:29:57,102 INFO L93 Difference]: Finished difference Result 257656 states and 448040 transitions. [2019-09-08 05:29:57,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:29:57,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 266 [2019-09-08 05:29:57,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:29:57,678 INFO L225 Difference]: With dead ends: 257656 [2019-09-08 05:29:57,678 INFO L226 Difference]: Without dead ends: 128887 [2019-09-08 05:29:58,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-08 05:29:58,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128887 states. [2019-09-08 05:30:05,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128887 to 128881. [2019-09-08 05:30:05,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128881 states. [2019-09-08 05:30:07,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128881 states to 128881 states and 224079 transitions. [2019-09-08 05:30:07,345 INFO L78 Accepts]: Start accepts. Automaton has 128881 states and 224079 transitions. Word has length 266 [2019-09-08 05:30:07,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:30:07,346 INFO L475 AbstractCegarLoop]: Abstraction has 128881 states and 224079 transitions. [2019-09-08 05:30:07,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:30:07,346 INFO L276 IsEmpty]: Start isEmpty. Operand 128881 states and 224079 transitions. [2019-09-08 05:30:07,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-08 05:30:07,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:30:07,692 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:30:07,692 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:30:07,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:30:07,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1845586897, now seen corresponding path program 1 times [2019-09-08 05:30:07,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:30:07,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:30:07,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:30:07,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:30:07,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:30:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:30:08,062 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 05:30:08,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:30:08,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 05:30:08,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 05:30:08,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 05:30:08,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:30:08,063 INFO L87 Difference]: Start difference. First operand 128881 states and 224079 transitions. Second operand 20 states. [2019-09-08 05:30:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:30:19,119 INFO L93 Difference]: Finished difference Result 143487 states and 243022 transitions. [2019-09-08 05:30:19,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 05:30:19,120 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 266 [2019-09-08 05:30:19,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:30:19,570 INFO L225 Difference]: With dead ends: 143487 [2019-09-08 05:30:19,570 INFO L226 Difference]: Without dead ends: 137362 [2019-09-08 05:30:19,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=292, Invalid=1870, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 05:30:19,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137362 states. [2019-09-08 05:30:27,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137362 to 135928. [2019-09-08 05:30:27,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135928 states. [2019-09-08 05:30:28,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135928 states to 135928 states and 233241 transitions. [2019-09-08 05:30:28,034 INFO L78 Accepts]: Start accepts. Automaton has 135928 states and 233241 transitions. Word has length 266 [2019-09-08 05:30:28,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:30:28,035 INFO L475 AbstractCegarLoop]: Abstraction has 135928 states and 233241 transitions. [2019-09-08 05:30:28,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 05:30:28,035 INFO L276 IsEmpty]: Start isEmpty. Operand 135928 states and 233241 transitions. [2019-09-08 05:30:28,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 05:30:28,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:30:28,441 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:30:28,441 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:30:28,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:30:28,442 INFO L82 PathProgramCache]: Analyzing trace with hash -497734116, now seen corresponding path program 1 times [2019-09-08 05:30:28,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:30:28,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:30:28,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:30:28,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:30:28,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:30:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:30:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 05:30:28,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:30:28,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:30:28,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:30:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:30:29,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 2927 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 05:30:29,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:30:29,182 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:30:29,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:30:29,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4] total 13 [2019-09-08 05:30:29,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:30:29,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:30:29,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:30:29,212 INFO L87 Difference]: Start difference. First operand 135928 states and 233241 transitions. Second operand 13 states. [2019-09-08 05:30:54,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:30:54,367 INFO L93 Difference]: Finished difference Result 385474 states and 677884 transitions. [2019-09-08 05:30:54,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 05:30:54,367 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 250 [2019-09-08 05:30:54,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:30:55,831 INFO L225 Difference]: With dead ends: 385474 [2019-09-08 05:30:55,831 INFO L226 Difference]: Without dead ends: 334950 [2019-09-08 05:30:56,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2019-09-08 05:30:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334950 states. [2019-09-08 05:31:13,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334950 to 273706. [2019-09-08 05:31:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273706 states. [2019-09-08 05:31:24,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273706 states to 273706 states and 476577 transitions. [2019-09-08 05:31:24,837 INFO L78 Accepts]: Start accepts. Automaton has 273706 states and 476577 transitions. Word has length 250 [2019-09-08 05:31:24,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:31:24,837 INFO L475 AbstractCegarLoop]: Abstraction has 273706 states and 476577 transitions. [2019-09-08 05:31:24,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:31:24,837 INFO L276 IsEmpty]: Start isEmpty. Operand 273706 states and 476577 transitions. [2019-09-08 05:31:25,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-08 05:31:25,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:31:25,734 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:31:25,734 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:31:25,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:31:25,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2005519711, now seen corresponding path program 1 times [2019-09-08 05:31:25,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:31:25,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:31:25,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:25,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:31:25,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:31:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:31:25,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:31:25,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:31:25,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:31:25,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:31:25,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:31:25,881 INFO L87 Difference]: Start difference. First operand 273706 states and 476577 transitions. Second operand 3 states. [2019-09-08 05:31:53,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:31:53,430 INFO L93 Difference]: Finished difference Result 657397 states and 1196583 transitions. [2019-09-08 05:31:53,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:31:53,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 266 [2019-09-08 05:31:53,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:31:56,061 INFO L225 Difference]: With dead ends: 657397 [2019-09-08 05:31:56,061 INFO L226 Difference]: Without dead ends: 384354 [2019-09-08 05:31:56,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:31:57,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384354 states. [2019-09-08 05:32:33,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384354 to 384144. [2019-09-08 05:32:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384144 states. [2019-09-08 05:32:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384144 states to 384144 states and 717519 transitions. [2019-09-08 05:32:35,194 INFO L78 Accepts]: Start accepts. Automaton has 384144 states and 717519 transitions. Word has length 266 [2019-09-08 05:32:35,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:32:35,195 INFO L475 AbstractCegarLoop]: Abstraction has 384144 states and 717519 transitions. [2019-09-08 05:32:35,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:32:35,195 INFO L276 IsEmpty]: Start isEmpty. Operand 384144 states and 717519 transitions. [2019-09-08 05:32:38,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-08 05:32:38,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:32:38,484 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:32:38,484 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:32:38,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:32:38,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1623672532, now seen corresponding path program 1 times [2019-09-08 05:32:38,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:32:38,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:32:38,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:32:38,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:32:38,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:32:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:32:38,737 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 05:32:38,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:32:38,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:32:38,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:32:38,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:32:38,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:32:38,739 INFO L87 Difference]: Start difference. First operand 384144 states and 717519 transitions. Second operand 6 states. [2019-09-08 05:33:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:33:09,958 INFO L93 Difference]: Finished difference Result 768141 states and 1437727 transitions. [2019-09-08 05:33:09,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:33:09,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 286 [2019-09-08 05:33:09,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:33:11,568 INFO L225 Difference]: With dead ends: 768141 [2019-09-08 05:33:11,568 INFO L226 Difference]: Without dead ends: 384536 [2019-09-08 05:33:12,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:33:12,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384536 states. [2019-09-08 05:33:51,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384536 to 384086. [2019-09-08 05:33:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384086 states. [2019-09-08 05:33:54,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384086 states to 384086 states and 717282 transitions. [2019-09-08 05:33:54,299 INFO L78 Accepts]: Start accepts. Automaton has 384086 states and 717282 transitions. Word has length 286 [2019-09-08 05:33:54,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:33:54,299 INFO L475 AbstractCegarLoop]: Abstraction has 384086 states and 717282 transitions. [2019-09-08 05:33:54,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:33:54,299 INFO L276 IsEmpty]: Start isEmpty. Operand 384086 states and 717282 transitions. [2019-09-08 05:34:08,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 05:34:08,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:34:08,763 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:34:08,763 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:34:08,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:34:08,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1174564605, now seen corresponding path program 1 times [2019-09-08 05:34:08,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:34:08,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:34:08,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:34:08,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:34:08,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:34:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:34:08,883 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:34:08,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:34:08,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:34:08,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:34:08,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:34:08,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:34:08,884 INFO L87 Difference]: Start difference. First operand 384086 states and 717282 transitions. Second operand 3 states. [2019-09-08 05:34:55,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:34:55,122 INFO L93 Difference]: Finished difference Result 979461 states and 1912920 transitions. [2019-09-08 05:34:55,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:34:55,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2019-09-08 05:34:55,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:34:59,310 INFO L225 Difference]: With dead ends: 979461 [2019-09-08 05:34:59,310 INFO L226 Difference]: Without dead ends: 596086 [2019-09-08 05:35:00,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:35:01,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596086 states.