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_spec7_product34.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:36:34,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:36:34,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:36:34,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:36:34,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:36:34,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:36:34,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:36:34,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:36:34,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:36:34,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:36:34,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:36:34,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:36:34,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:36:34,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:36:34,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:36:34,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:36:34,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:36:34,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:36:34,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:36:34,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:36:34,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:36:34,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:36:34,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:36:34,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:36:34,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:36:34,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:36:34,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:36:34,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:36:34,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:36:34,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:36:34,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:36:34,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:36:34,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:36:34,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:36:34,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:36:34,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:36:34,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:36:34,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:36:34,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:36:34,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:36:34,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:36:34,218 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:36:34,250 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:36:34,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:36:34,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:36:34,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:36:34,252 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:36:34,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:36:34,252 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:36:34,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:36:34,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:36:34,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:36:34,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:36:34,253 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:36:34,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:36:34,254 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:36:34,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:36:34,256 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:36:34,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:36:34,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:36:34,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:36:34,257 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:36:34,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:36:34,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:36:34,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:36:34,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:36:34,258 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:36:34,259 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:36:34,259 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:36:34,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:36:34,259 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:36:34,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:36:34,309 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:36:34,313 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:36:34,315 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:36:34,316 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:36:34,316 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec7_product34.cil.c [2019-09-08 05:36:34,385 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c96b7eb7c/8e709528e6b54e25b22187b75a321abb/FLAGbecf3b322 [2019-09-08 05:36:35,008 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:36:35,009 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product34.cil.c [2019-09-08 05:36:35,047 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c96b7eb7c/8e709528e6b54e25b22187b75a321abb/FLAGbecf3b322 [2019-09-08 05:36:35,213 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c96b7eb7c/8e709528e6b54e25b22187b75a321abb [2019-09-08 05:36:35,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:36:35,229 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:36:35,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:36:35,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:36:35,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:36:35,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:36:35" (1/1) ... [2019-09-08 05:36:35,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3008639d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:35, skipping insertion in model container [2019-09-08 05:36:35,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:36:35" (1/1) ... [2019-09-08 05:36:35,248 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:36:35,341 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:36:36,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:36:36,179 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:36:36,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:36:36,464 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:36:36,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:36 WrapperNode [2019-09-08 05:36:36,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:36:36,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:36:36,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:36:36,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:36:36,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:36" (1/1) ... [2019-09-08 05:36:36,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:36" (1/1) ... [2019-09-08 05:36:36,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:36" (1/1) ... [2019-09-08 05:36:36,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:36" (1/1) ... [2019-09-08 05:36:36,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:36" (1/1) ... [2019-09-08 05:36:36,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:36" (1/1) ... [2019-09-08 05:36:36,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:36" (1/1) ... [2019-09-08 05:36:36,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:36:36,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:36:36,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:36:36,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:36:36,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:36" (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:36:36,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:36:36,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:36:36,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:36:36,754 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:36:36,755 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:36:36,755 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:36:36,756 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:36:36,756 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:36:36,757 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:36:36,757 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:36:36,757 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:36:36,758 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:36:36,758 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:36:36,758 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:36:36,759 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:36:36,760 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:36:36,762 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:36:36,763 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:36:36,763 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:36:36,763 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:36:36,763 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:36:36,764 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:36:36,764 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 05:36:36,764 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 05:36:36,764 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:36:36,764 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-08 05:36:36,764 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-08 05:36:36,764 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:36:36,765 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:36:36,765 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:36:36,765 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:36:36,765 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:36:36,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptVerify_spec__1 [2019-09-08 05:36:36,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:36:36,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:36:36,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:36:36,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:36:36,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:36:36,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:36:36,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:36:36,767 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:36:36,767 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:36:36,767 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:36:36,767 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:36:36,768 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:36:36,768 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:36:36,768 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:36:36,769 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:36:36,769 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:36:36,769 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:36:36,769 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:36:36,769 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:36:36,769 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:36:36,770 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:36:36,770 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:36:36,770 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:36:36,770 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:36:36,770 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:36:36,770 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:36:36,772 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:36:36,773 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:36:36,773 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:36:36,773 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:36:36,773 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:36:36,773 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:36:36,774 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:36:36,774 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:36:36,774 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:36:36,774 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:36:36,775 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:36:36,775 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:36:36,775 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:36:36,775 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:36:36,775 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:36:36,776 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:36:36,776 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:36:36,777 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:36:36,777 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:36:36,777 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:36:36,777 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:36:36,777 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:36:36,778 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:36:36,778 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:36:36,778 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:36:36,779 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:36:36,779 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:36:36,779 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:36:36,779 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:36:36,779 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:36:36,779 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:36:36,779 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:36:36,780 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:36:36,781 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:36:36,781 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:36:36,781 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:36:36,781 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:36:36,781 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:36:36,781 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-09-08 05:36:36,782 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-08 05:36:36,782 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:36:36,782 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:36:36,782 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 05:36:36,782 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-08 05:36:36,782 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 05:36:36,783 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:36:36,783 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:36:36,783 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:36:36,783 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:36:36,783 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:36:36,783 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:36:36,784 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:36:36,784 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:36:36,784 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:36:36,784 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 05:36:36,784 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:36:36,784 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 05:36:36,784 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:36:36,785 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:36:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:36:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:36:36,786 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:36:36,786 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:36:36,786 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:36:36,787 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:36:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:36:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:36:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:36:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:36:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:36:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:36:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:36:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:36:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:36:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:36:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:36:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:36:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:36:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:36:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:36:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:36:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:36:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:36:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:36:36,797 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:36:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:36:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:36:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:36:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:36:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:36:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:36:36,808 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:36:36,808 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:36:36,808 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:36:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:36:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:36:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:36:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:36:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:36:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:36:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 05:36:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 05:36:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:36:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:36:36,811 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:36:36,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:36:36,811 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:36:36,811 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:36:36,811 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:36:36,812 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:36:36,812 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:36:36,812 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:36:36,812 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:36:36,812 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:36:36,812 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:36:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:36:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:36:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:36:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:36:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:36:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:36:36,814 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-08 05:36:36,814 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-08 05:36:36,814 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:36:36,814 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:36:36,814 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptVerify_spec__1 [2019-09-08 05:36:36,814 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:36:36,816 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:36:36,816 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:36:36,816 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:36:36,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:36:36,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:36:36,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:36:36,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:36:36,817 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:36:36,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:36:36,817 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:36:36,817 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:36:36,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:36:36,818 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:36:36,818 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:36:36,818 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:36:36,818 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:36:36,818 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:36:36,819 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:36:36,819 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:36:36,819 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:36:36,819 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:36:36,819 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:36:36,819 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:36:36,820 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:36:36,820 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:36:36,820 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:36:36,820 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:36:36,820 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:36:36,820 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:36:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:36:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:36:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:36:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:36:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:36:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:36:36,822 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:36:36,822 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:36:36,822 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:36:36,822 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:36:36,822 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:36:36,822 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:36:36,823 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:36:36,823 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:36:36,823 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:36:36,823 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:36:36,823 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:36:36,823 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:36:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:36:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:36:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:36:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:36:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:36:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 05:36:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:36:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 05:36:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:36:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:36:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-09-08 05:36:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-08 05:36:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 05:36:36,826 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-08 05:36:36,826 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 05:36:36,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:36:36,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:36:36,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:36:39,063 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:36:39,064 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:36:39,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:36:39 BoogieIcfgContainer [2019-09-08 05:36:39,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:36:39,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:36:39,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:36:39,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:36:39,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:36:35" (1/3) ... [2019-09-08 05:36:39,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db3c2cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:36:39, skipping insertion in model container [2019-09-08 05:36:39,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:36" (2/3) ... [2019-09-08 05:36:39,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db3c2cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:36:39, skipping insertion in model container [2019-09-08 05:36:39,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:36:39" (3/3) ... [2019-09-08 05:36:39,075 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec7_product34.cil.c [2019-09-08 05:36:39,086 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:36:39,098 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:36:39,119 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:36:39,171 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:36:39,171 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:36:39,172 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:36:39,172 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:36:39,172 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:36:39,175 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:36:39,175 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:36:39,175 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:36:39,175 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:36:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states. [2019-09-08 05:36:39,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 05:36:39,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:39,262 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:36:39,266 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:39,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:39,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2043582156, now seen corresponding path program 1 times [2019-09-08 05:36:39,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:39,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:39,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:39,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:39,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:36:39,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:39,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:36:39,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:36:39,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:36:39,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:36:39,929 INFO L87 Difference]: Start difference. First operand 647 states. Second operand 2 states. [2019-09-08 05:36:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:40,055 INFO L93 Difference]: Finished difference Result 980 states and 1322 transitions. [2019-09-08 05:36:40,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:36:40,058 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 191 [2019-09-08 05:36:40,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:40,093 INFO L225 Difference]: With dead ends: 980 [2019-09-08 05:36:40,093 INFO L226 Difference]: Without dead ends: 618 [2019-09-08 05:36:40,101 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:36:40,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-08 05:36:40,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-09-08 05:36:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-08 05:36:40,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 838 transitions. [2019-09-08 05:36:40,208 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 838 transitions. Word has length 191 [2019-09-08 05:36:40,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:40,212 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 838 transitions. [2019-09-08 05:36:40,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:36:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 838 transitions. [2019-09-08 05:36:40,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 05:36:40,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:40,219 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:36:40,219 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:40,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:40,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1146061920, now seen corresponding path program 1 times [2019-09-08 05:36:40,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:40,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:40,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:40,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:40,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:36:40,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:40,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:36:40,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:36:40,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:36:40,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:36:40,570 INFO L87 Difference]: Start difference. First operand 618 states and 838 transitions. Second operand 3 states. [2019-09-08 05:36:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:40,627 INFO L93 Difference]: Finished difference Result 963 states and 1284 transitions. [2019-09-08 05:36:40,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:36:40,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-09-08 05:36:40,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:40,634 INFO L225 Difference]: With dead ends: 963 [2019-09-08 05:36:40,634 INFO L226 Difference]: Without dead ends: 621 [2019-09-08 05:36:40,637 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:36:40,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-09-08 05:36:40,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 620. [2019-09-08 05:36:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 05:36:40,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 840 transitions. [2019-09-08 05:36:40,740 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 840 transitions. Word has length 192 [2019-09-08 05:36:40,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:40,741 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 840 transitions. [2019-09-08 05:36:40,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:36:40,741 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 840 transitions. [2019-09-08 05:36:40,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-08 05:36:40,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:40,748 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:36:40,748 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:40,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:40,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1233594516, now seen corresponding path program 1 times [2019-09-08 05:36:40,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:40,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:40,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:40,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:40,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:36:40,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:40,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:36:40,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:36:40,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:36:40,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:36:40,966 INFO L87 Difference]: Start difference. First operand 620 states and 840 transitions. Second operand 3 states. [2019-09-08 05:36:41,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:41,031 INFO L93 Difference]: Finished difference Result 1218 states and 1681 transitions. [2019-09-08 05:36:41,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:36:41,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-09-08 05:36:41,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:41,042 INFO L225 Difference]: With dead ends: 1218 [2019-09-08 05:36:41,043 INFO L226 Difference]: Without dead ends: 663 [2019-09-08 05:36:41,045 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:36:41,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-09-08 05:36:41,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 662. [2019-09-08 05:36:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-09-08 05:36:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 912 transitions. [2019-09-08 05:36:41,103 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 912 transitions. Word has length 198 [2019-09-08 05:36:41,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:41,104 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 912 transitions. [2019-09-08 05:36:41,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:36:41,104 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 912 transitions. [2019-09-08 05:36:41,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 05:36:41,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:41,115 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:36:41,115 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:41,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:41,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1272697570, now seen corresponding path program 1 times [2019-09-08 05:36:41,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:41,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:41,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:41,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:41,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 05:36:41,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:41,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 05:36:41,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 05:36:41,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 05:36:41,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:36:41,811 INFO L87 Difference]: Start difference. First operand 662 states and 912 transitions. Second operand 19 states. [2019-09-08 05:36:47,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:47,451 INFO L93 Difference]: Finished difference Result 2344 states and 3255 transitions. [2019-09-08 05:36:47,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 05:36:47,452 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 199 [2019-09-08 05:36:47,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:47,472 INFO L225 Difference]: With dead ends: 2344 [2019-09-08 05:36:47,473 INFO L226 Difference]: Without dead ends: 2015 [2019-09-08 05:36:47,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 05:36:47,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2019-09-08 05:36:47,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1978. [2019-09-08 05:36:47,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2019-09-08 05:36:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2751 transitions. [2019-09-08 05:36:47,616 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2751 transitions. Word has length 199 [2019-09-08 05:36:47,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:47,617 INFO L475 AbstractCegarLoop]: Abstraction has 1978 states and 2751 transitions. [2019-09-08 05:36:47,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 05:36:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2751 transitions. [2019-09-08 05:36:47,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 05:36:47,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:47,625 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:36:47,625 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:47,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:47,626 INFO L82 PathProgramCache]: Analyzing trace with hash -578893885, now seen corresponding path program 1 times [2019-09-08 05:36:47,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:47,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:47,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:47,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:47,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:47,924 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:47,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:47,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 05:36:47,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:36:47,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:36:47,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:36:47,926 INFO L87 Difference]: Start difference. First operand 1978 states and 2751 transitions. Second operand 13 states. [2019-09-08 05:36:48,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:48,637 INFO L93 Difference]: Finished difference Result 3495 states and 4856 transitions. [2019-09-08 05:36:48,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:36:48,638 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 200 [2019-09-08 05:36:48,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:48,652 INFO L225 Difference]: With dead ends: 3495 [2019-09-08 05:36:48,652 INFO L226 Difference]: Without dead ends: 2112 [2019-09-08 05:36:48,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:36:48,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2019-09-08 05:36:48,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 2112. [2019-09-08 05:36:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2112 states. [2019-09-08 05:36:48,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2968 transitions. [2019-09-08 05:36:48,768 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2968 transitions. Word has length 200 [2019-09-08 05:36:48,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:48,769 INFO L475 AbstractCegarLoop]: Abstraction has 2112 states and 2968 transitions. [2019-09-08 05:36:48,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:36:48,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2968 transitions. [2019-09-08 05:36:48,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 05:36:48,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:48,776 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:36:48,776 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:48,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:48,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1707911070, now seen corresponding path program 1 times [2019-09-08 05:36:48,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:48,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:48,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:48,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:48,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 05:36:49,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:49,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 05:36:49,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 05:36:49,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 05:36:49,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:36:49,081 INFO L87 Difference]: Start difference. First operand 2112 states and 2968 transitions. Second operand 15 states. [2019-09-08 05:36:52,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:52,975 INFO L93 Difference]: Finished difference Result 3667 states and 5151 transitions. [2019-09-08 05:36:52,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 05:36:52,976 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 200 [2019-09-08 05:36:52,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:52,996 INFO L225 Difference]: With dead ends: 3667 [2019-09-08 05:36:52,996 INFO L226 Difference]: Without dead ends: 2230 [2019-09-08 05:36:53,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 05:36:53,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2019-09-08 05:36:53,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2193. [2019-09-08 05:36:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2193 states. [2019-09-08 05:36:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 3108 transitions. [2019-09-08 05:36:53,151 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 3108 transitions. Word has length 200 [2019-09-08 05:36:53,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:53,152 INFO L475 AbstractCegarLoop]: Abstraction has 2193 states and 3108 transitions. [2019-09-08 05:36:53,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 05:36:53,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 3108 transitions. [2019-09-08 05:36:53,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-08 05:36:53,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:53,162 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:36:53,162 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:53,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:53,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1247468478, now seen corresponding path program 1 times [2019-09-08 05:36:53,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:53,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:53,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:53,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:53,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 05:36:53,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:53,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:36:53,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:36:53,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:36:53,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:36:53,332 INFO L87 Difference]: Start difference. First operand 2193 states and 3108 transitions. Second operand 5 states. [2019-09-08 05:36:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:53,464 INFO L93 Difference]: Finished difference Result 3332 states and 4650 transitions. [2019-09-08 05:36:53,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:36:53,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-08 05:36:53,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:53,477 INFO L225 Difference]: With dead ends: 3332 [2019-09-08 05:36:53,477 INFO L226 Difference]: Without dead ends: 1767 [2019-09-08 05:36:53,483 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:36:53,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-09-08 05:36:53,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1767. [2019-09-08 05:36:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2019-09-08 05:36:53,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2502 transitions. [2019-09-08 05:36:53,574 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2502 transitions. Word has length 203 [2019-09-08 05:36:53,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:53,576 INFO L475 AbstractCegarLoop]: Abstraction has 1767 states and 2502 transitions. [2019-09-08 05:36:53,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:36:53,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2502 transitions. [2019-09-08 05:36:53,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 05:36:53,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:53,582 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:36:53,583 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:53,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:53,583 INFO L82 PathProgramCache]: Analyzing trace with hash -430417368, now seen corresponding path program 1 times [2019-09-08 05:36:53,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:53,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:53,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:53,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:53,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 05:36:54,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:54,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:36:54,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:36:54,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:36:54,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:36:54,011 INFO L87 Difference]: Start difference. First operand 1767 states and 2502 transitions. Second operand 18 states. [2019-09-08 05:36:54,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:54,562 INFO L93 Difference]: Finished difference Result 2936 states and 4113 transitions. [2019-09-08 05:36:54,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:36:54,562 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 200 [2019-09-08 05:36:54,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:54,574 INFO L225 Difference]: With dead ends: 2936 [2019-09-08 05:36:54,574 INFO L226 Difference]: Without dead ends: 1799 [2019-09-08 05:36:54,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:36:54,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2019-09-08 05:36:54,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1797. [2019-09-08 05:36:54,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2019-09-08 05:36:54,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2531 transitions. [2019-09-08 05:36:54,691 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2531 transitions. Word has length 200 [2019-09-08 05:36:54,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:54,693 INFO L475 AbstractCegarLoop]: Abstraction has 1797 states and 2531 transitions. [2019-09-08 05:36:54,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:36:54,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2531 transitions. [2019-09-08 05:36:54,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 05:36:54,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:54,704 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:36:54,704 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:54,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:54,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1294591828, now seen corresponding path program 1 times [2019-09-08 05:36:54,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:54,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:54,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:54,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:54,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:54,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:54,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:36:54,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:36:54,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:36:54,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:36:54,973 INFO L87 Difference]: Start difference. First operand 1797 states and 2531 transitions. Second operand 5 states. [2019-09-08 05:36:56,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:56,361 INFO L93 Difference]: Finished difference Result 4842 states and 6862 transitions. [2019-09-08 05:36:56,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 05:36:56,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 200 [2019-09-08 05:36:56,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:56,386 INFO L225 Difference]: With dead ends: 4842 [2019-09-08 05:36:56,386 INFO L226 Difference]: Without dead ends: 4045 [2019-09-08 05:36:56,392 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:36:56,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4045 states. [2019-09-08 05:36:56,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4045 to 4031. [2019-09-08 05:36:56,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4031 states. [2019-09-08 05:36:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 5704 transitions. [2019-09-08 05:36:56,587 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 5704 transitions. Word has length 200 [2019-09-08 05:36:56,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:56,589 INFO L475 AbstractCegarLoop]: Abstraction has 4031 states and 5704 transitions. [2019-09-08 05:36:56,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:36:56,589 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 5704 transitions. [2019-09-08 05:36:56,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 05:36:56,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:56,601 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:36:56,602 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:56,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:56,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1274254453, now seen corresponding path program 1 times [2019-09-08 05:36:56,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:56,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:56,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:56,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:56,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:56,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:56,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:36:56,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:36:56,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:36:56,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:36:56,828 INFO L87 Difference]: Start difference. First operand 4031 states and 5704 transitions. Second operand 7 states. [2019-09-08 05:36:59,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:59,334 INFO L93 Difference]: Finished difference Result 13480 states and 20830 transitions. [2019-09-08 05:36:59,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:36:59,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2019-09-08 05:36:59,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:59,416 INFO L225 Difference]: With dead ends: 13480 [2019-09-08 05:36:59,416 INFO L226 Difference]: Without dead ends: 10373 [2019-09-08 05:36:59,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:36:59,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10373 states. [2019-09-08 05:37:00,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10373 to 10363. [2019-09-08 05:37:00,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10363 states. [2019-09-08 05:37:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10363 states to 10363 states and 15752 transitions. [2019-09-08 05:37:00,146 INFO L78 Accepts]: Start accepts. Automaton has 10363 states and 15752 transitions. Word has length 200 [2019-09-08 05:37:00,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:00,146 INFO L475 AbstractCegarLoop]: Abstraction has 10363 states and 15752 transitions. [2019-09-08 05:37:00,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:37:00,147 INFO L276 IsEmpty]: Start isEmpty. Operand 10363 states and 15752 transitions. [2019-09-08 05:37:00,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-08 05:37:00,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:00,165 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:37:00,165 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:00,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:00,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1884885610, now seen corresponding path program 1 times [2019-09-08 05:37:00,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:00,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:00,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:00,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:00,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:00,747 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:37:00,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:37:00,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-08 05:37:00,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 05:37:00,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 05:37:00,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-09-08 05:37:00,750 INFO L87 Difference]: Start difference. First operand 10363 states and 15752 transitions. Second operand 28 states. [2019-09-08 05:37:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:02,122 INFO L93 Difference]: Finished difference Result 20153 states and 31327 transitions. [2019-09-08 05:37:02,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 05:37:02,122 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 201 [2019-09-08 05:37:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:02,196 INFO L225 Difference]: With dead ends: 20153 [2019-09-08 05:37:02,196 INFO L226 Difference]: Without dead ends: 10714 [2019-09-08 05:37:02,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 05:37:02,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10714 states. [2019-09-08 05:37:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10714 to 10689. [2019-09-08 05:37:02,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10689 states. [2019-09-08 05:37:02,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10689 states to 10689 states and 16211 transitions. [2019-09-08 05:37:02,747 INFO L78 Accepts]: Start accepts. Automaton has 10689 states and 16211 transitions. Word has length 201 [2019-09-08 05:37:02,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:02,748 INFO L475 AbstractCegarLoop]: Abstraction has 10689 states and 16211 transitions. [2019-09-08 05:37:02,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 05:37:02,748 INFO L276 IsEmpty]: Start isEmpty. Operand 10689 states and 16211 transitions. [2019-09-08 05:37:02,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 05:37:02,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:02,757 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:37:02,757 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:02,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:02,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1510972251, now seen corresponding path program 1 times [2019-09-08 05:37:02,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:02,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:02,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:02,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:02,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:02,981 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:37:02,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:37:02,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 05:37:02,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:37:02,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:37:02,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:37:02,983 INFO L87 Difference]: Start difference. First operand 10689 states and 16211 transitions. Second operand 10 states. [2019-09-08 05:37:03,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:03,185 INFO L93 Difference]: Finished difference Result 10788 states and 16397 transitions. [2019-09-08 05:37:03,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:37:03,186 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 205 [2019-09-08 05:37:03,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:03,241 INFO L225 Difference]: With dead ends: 10788 [2019-09-08 05:37:03,241 INFO L226 Difference]: Without dead ends: 10785 [2019-09-08 05:37:03,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:37:03,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10785 states. [2019-09-08 05:37:04,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10785 to 10785. [2019-09-08 05:37:04,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10785 states. [2019-09-08 05:37:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10785 states to 10785 states and 16363 transitions. [2019-09-08 05:37:04,416 INFO L78 Accepts]: Start accepts. Automaton has 10785 states and 16363 transitions. Word has length 205 [2019-09-08 05:37:04,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:04,417 INFO L475 AbstractCegarLoop]: Abstraction has 10785 states and 16363 transitions. [2019-09-08 05:37:04,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:37:04,418 INFO L276 IsEmpty]: Start isEmpty. Operand 10785 states and 16363 transitions. [2019-09-08 05:37:04,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 05:37:04,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:04,426 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:37:04,426 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:04,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:04,427 INFO L82 PathProgramCache]: Analyzing trace with hash -125913428, now seen corresponding path program 1 times [2019-09-08 05:37:04,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:04,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:04,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:04,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:04,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:04,569 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:37:04,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:37:04,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:37:04,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:37:04,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:37:04,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:37:04,571 INFO L87 Difference]: Start difference. First operand 10785 states and 16363 transitions. Second operand 5 states. [2019-09-08 05:37:04,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:04,814 INFO L93 Difference]: Finished difference Result 20853 states and 32089 transitions. [2019-09-08 05:37:04,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:37:04,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 05:37:04,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:04,880 INFO L225 Difference]: With dead ends: 20853 [2019-09-08 05:37:04,881 INFO L226 Difference]: Without dead ends: 11040 [2019-09-08 05:37:04,918 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:37:04,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11040 states. [2019-09-08 05:37:05,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11040 to 10889. [2019-09-08 05:37:05,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10889 states. [2019-09-08 05:37:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10889 states to 10889 states and 16480 transitions. [2019-09-08 05:37:05,608 INFO L78 Accepts]: Start accepts. Automaton has 10889 states and 16480 transitions. Word has length 210 [2019-09-08 05:37:05,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:05,608 INFO L475 AbstractCegarLoop]: Abstraction has 10889 states and 16480 transitions. [2019-09-08 05:37:05,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:37:05,609 INFO L276 IsEmpty]: Start isEmpty. Operand 10889 states and 16480 transitions. [2019-09-08 05:37:05,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-08 05:37:05,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:05,616 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:37:05,617 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:05,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:05,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1745370427, now seen corresponding path program 1 times [2019-09-08 05:37:05,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:05,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:05,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:05,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:05,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:05,775 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:37:05,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:37:05,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:37:05,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:37:05,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:37:05,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:37:05,777 INFO L87 Difference]: Start difference. First operand 10889 states and 16480 transitions. Second operand 6 states. [2019-09-08 05:37:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:06,919 INFO L93 Difference]: Finished difference Result 31862 states and 48911 transitions. [2019-09-08 05:37:06,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:37:06,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2019-09-08 05:37:06,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:07,010 INFO L225 Difference]: With dead ends: 31862 [2019-09-08 05:37:07,011 INFO L226 Difference]: Without dead ends: 21897 [2019-09-08 05:37:07,050 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:37:07,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21897 states. [2019-09-08 05:37:07,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21897 to 21567. [2019-09-08 05:37:07,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21567 states. [2019-09-08 05:37:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21567 states to 21567 states and 32621 transitions. [2019-09-08 05:37:08,009 INFO L78 Accepts]: Start accepts. Automaton has 21567 states and 32621 transitions. Word has length 211 [2019-09-08 05:37:08,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:08,010 INFO L475 AbstractCegarLoop]: Abstraction has 21567 states and 32621 transitions. [2019-09-08 05:37:08,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:37:08,010 INFO L276 IsEmpty]: Start isEmpty. Operand 21567 states and 32621 transitions. [2019-09-08 05:37:08,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 05:37:08,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:08,027 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:37:08,027 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:08,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:08,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1076037564, now seen corresponding path program 1 times [2019-09-08 05:37:08,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:08,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:08,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:08,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:08,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:08,225 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:37:08,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:37:08,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:37:08,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:37:08,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:37:08,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:37:08,227 INFO L87 Difference]: Start difference. First operand 21567 states and 32621 transitions. Second operand 8 states. [2019-09-08 05:37:10,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:10,478 INFO L93 Difference]: Finished difference Result 64602 states and 100962 transitions. [2019-09-08 05:37:10,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:37:10,479 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 230 [2019-09-08 05:37:10,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:10,735 INFO L225 Difference]: With dead ends: 64602 [2019-09-08 05:37:10,735 INFO L226 Difference]: Without dead ends: 44734 [2019-09-08 05:37:10,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:37:10,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44734 states. [2019-09-08 05:37:13,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44734 to 44583. [2019-09-08 05:37:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44583 states. [2019-09-08 05:37:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44583 states to 44583 states and 68307 transitions. [2019-09-08 05:37:13,876 INFO L78 Accepts]: Start accepts. Automaton has 44583 states and 68307 transitions. Word has length 230 [2019-09-08 05:37:13,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:13,877 INFO L475 AbstractCegarLoop]: Abstraction has 44583 states and 68307 transitions. [2019-09-08 05:37:13,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:37:13,877 INFO L276 IsEmpty]: Start isEmpty. Operand 44583 states and 68307 transitions. [2019-09-08 05:37:13,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 05:37:13,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:13,910 INFO L399 BasicCegarLoop]: trace histogram [3, 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] [2019-09-08 05:37:13,910 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:13,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:13,910 INFO L82 PathProgramCache]: Analyzing trace with hash 661126540, now seen corresponding path program 1 times [2019-09-08 05:37:13,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:13,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:13,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:13,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:13,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 05:37:14,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:37:14,116 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:37:14,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:14,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 3150 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:37:14,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:37:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 05:37:14,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:37:14,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2019-09-08 05:37:14,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:37:14,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:37:14,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:37:14,931 INFO L87 Difference]: Start difference. First operand 44583 states and 68307 transitions. Second operand 18 states. [2019-09-08 05:37:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:18,529 INFO L93 Difference]: Finished difference Result 89476 states and 137178 transitions. [2019-09-08 05:37:18,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:37:18,529 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 231 [2019-09-08 05:37:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:18,871 INFO L225 Difference]: With dead ends: 89476 [2019-09-08 05:37:18,872 INFO L226 Difference]: Without dead ends: 44937 [2019-09-08 05:37:19,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 05:37:19,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44937 states. [2019-09-08 05:37:22,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44937 to 44729. [2019-09-08 05:37:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44729 states. [2019-09-08 05:37:22,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44729 states to 44729 states and 68502 transitions. [2019-09-08 05:37:22,304 INFO L78 Accepts]: Start accepts. Automaton has 44729 states and 68502 transitions. Word has length 231 [2019-09-08 05:37:22,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:22,305 INFO L475 AbstractCegarLoop]: Abstraction has 44729 states and 68502 transitions. [2019-09-08 05:37:22,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:37:22,305 INFO L276 IsEmpty]: Start isEmpty. Operand 44729 states and 68502 transitions. [2019-09-08 05:37:22,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 05:37:22,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:22,370 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:37:22,370 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:22,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:22,370 INFO L82 PathProgramCache]: Analyzing trace with hash -633515775, now seen corresponding path program 1 times [2019-09-08 05:37:22,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:22,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:22,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:22,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:22,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:22,685 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:37:22,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:37:22,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 05:37:22,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 05:37:22,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 05:37:22,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:37:22,687 INFO L87 Difference]: Start difference. First operand 44729 states and 68502 transitions. Second operand 15 states. [2019-09-08 05:37:28,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:28,268 INFO L93 Difference]: Finished difference Result 76125 states and 119841 transitions. [2019-09-08 05:37:28,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 05:37:28,268 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 232 [2019-09-08 05:37:28,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:28,741 INFO L225 Difference]: With dead ends: 76125 [2019-09-08 05:37:28,742 INFO L226 Difference]: Without dead ends: 44498 [2019-09-08 05:37:28,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 05:37:28,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44498 states. [2019-09-08 05:37:30,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44498 to 43824. [2019-09-08 05:37:30,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43824 states. [2019-09-08 05:37:30,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43824 states to 43824 states and 66391 transitions. [2019-09-08 05:37:30,361 INFO L78 Accepts]: Start accepts. Automaton has 43824 states and 66391 transitions. Word has length 232 [2019-09-08 05:37:30,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:30,362 INFO L475 AbstractCegarLoop]: Abstraction has 43824 states and 66391 transitions. [2019-09-08 05:37:30,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 05:37:30,362 INFO L276 IsEmpty]: Start isEmpty. Operand 43824 states and 66391 transitions. [2019-09-08 05:37:30,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 05:37:30,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:30,405 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:37:30,405 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:30,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:30,405 INFO L82 PathProgramCache]: Analyzing trace with hash 618843452, now seen corresponding path program 1 times [2019-09-08 05:37:30,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:30,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:30,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:30,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:30,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:30,603 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 05:37:30,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:37:30,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:37:30,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:37:30,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:37:30,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:37:30,605 INFO L87 Difference]: Start difference. First operand 43824 states and 66391 transitions. Second operand 7 states. [2019-09-08 05:37:40,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:40,050 INFO L93 Difference]: Finished difference Result 129360 states and 199317 transitions. [2019-09-08 05:37:40,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:37:40,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 232 [2019-09-08 05:37:40,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:40,542 INFO L225 Difference]: With dead ends: 129360 [2019-09-08 05:37:40,543 INFO L226 Difference]: Without dead ends: 89164 [2019-09-08 05:37:40,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:37:40,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89164 states. [2019-09-08 05:37:43,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89164 to 87541. [2019-09-08 05:37:43,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87541 states. [2019-09-08 05:37:47,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87541 states to 87541 states and 132201 transitions. [2019-09-08 05:37:47,180 INFO L78 Accepts]: Start accepts. Automaton has 87541 states and 132201 transitions. Word has length 232 [2019-09-08 05:37:47,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:47,181 INFO L475 AbstractCegarLoop]: Abstraction has 87541 states and 132201 transitions. [2019-09-08 05:37:47,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:37:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand 87541 states and 132201 transitions. [2019-09-08 05:37:47,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-08 05:37:47,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:47,227 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:37:47,228 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:47,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:47,228 INFO L82 PathProgramCache]: Analyzing trace with hash -146252718, now seen corresponding path program 1 times [2019-09-08 05:37:47,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:47,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:47,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:47,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:47,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:47,470 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 05:37:47,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:37:47,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:37:47,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:37:47,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:37:47,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:37:47,475 INFO L87 Difference]: Start difference. First operand 87541 states and 132201 transitions. Second operand 7 states. [2019-09-08 05:37:59,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:59,986 INFO L93 Difference]: Finished difference Result 256929 states and 393226 transitions. [2019-09-08 05:37:59,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:37:59,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 233 [2019-09-08 05:37:59,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:38:00,914 INFO L225 Difference]: With dead ends: 256929 [2019-09-08 05:38:00,914 INFO L226 Difference]: Without dead ends: 176791 [2019-09-08 05:38:01,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:38:01,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176791 states. [2019-09-08 05:38:10,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176791 to 173153. [2019-09-08 05:38:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173153 states. [2019-09-08 05:38:11,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173153 states to 173153 states and 260185 transitions. [2019-09-08 05:38:11,687 INFO L78 Accepts]: Start accepts. Automaton has 173153 states and 260185 transitions. Word has length 233 [2019-09-08 05:38:11,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:38:11,688 INFO L475 AbstractCegarLoop]: Abstraction has 173153 states and 260185 transitions. [2019-09-08 05:38:11,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:38:11,688 INFO L276 IsEmpty]: Start isEmpty. Operand 173153 states and 260185 transitions. [2019-09-08 05:38:11,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-08 05:38:11,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:38:11,794 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:38:11,794 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:38:11,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:38:11,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1653334693, now seen corresponding path program 1 times [2019-09-08 05:38:11,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:38:11,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:38:11,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:11,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:38:11,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:38:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 05:38:11,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:38:11,990 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:38:12,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:38:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:38:13,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 3152 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:38:13,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:38:13,576 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 05:38:13,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:38:13,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-09-08 05:38:13,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:38:13,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:38:13,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:38:13,586 INFO L87 Difference]: Start difference. First operand 173153 states and 260185 transitions. Second operand 11 states. [2019-09-08 05:38:25,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:38:25,900 INFO L93 Difference]: Finished difference Result 389701 states and 589121 transitions. [2019-09-08 05:38:25,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:38:25,900 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 233 [2019-09-08 05:38:25,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:38:26,840 INFO L225 Difference]: With dead ends: 389701 [2019-09-08 05:38:26,841 INFO L226 Difference]: Without dead ends: 223456 [2019-09-08 05:38:27,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-09-08 05:38:27,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223456 states. [2019-09-08 05:38:41,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223456 to 219621. [2019-09-08 05:38:41,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219621 states. [2019-09-08 05:38:42,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219621 states to 219621 states and 323741 transitions. [2019-09-08 05:38:42,061 INFO L78 Accepts]: Start accepts. Automaton has 219621 states and 323741 transitions. Word has length 233 [2019-09-08 05:38:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:38:42,061 INFO L475 AbstractCegarLoop]: Abstraction has 219621 states and 323741 transitions. [2019-09-08 05:38:42,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:38:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 219621 states and 323741 transitions. [2019-09-08 05:38:42,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-08 05:38:42,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:38:42,135 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:38:42,135 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:38:42,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:38:42,136 INFO L82 PathProgramCache]: Analyzing trace with hash 383157141, now seen corresponding path program 1 times [2019-09-08 05:38:42,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:38:42,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:38:42,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:42,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:38:42,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:38:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-08 05:38:42,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:38:42,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:38:42,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:38:42,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:38:42,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:38:42,287 INFO L87 Difference]: Start difference. First operand 219621 states and 323741 transitions. Second operand 3 states. [2019-09-08 05:38:54,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:38:54,691 INFO L93 Difference]: Finished difference Result 443059 states and 655681 transitions. [2019-09-08 05:38:54,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:38:54,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-09-08 05:38:54,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:38:55,568 INFO L225 Difference]: With dead ends: 443059 [2019-09-08 05:38:55,569 INFO L226 Difference]: Without dead ends: 223749 [2019-09-08 05:38:55,978 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:38:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223749 states. [2019-09-08 05:39:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223749 to 223701. [2019-09-08 05:39:05,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223701 states. [2019-09-08 05:39:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223701 states to 223701 states and 332189 transitions. [2019-09-08 05:39:06,655 INFO L78 Accepts]: Start accepts. Automaton has 223701 states and 332189 transitions. Word has length 260 [2019-09-08 05:39:06,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:06,656 INFO L475 AbstractCegarLoop]: Abstraction has 223701 states and 332189 transitions. [2019-09-08 05:39:06,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:39:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 223701 states and 332189 transitions. [2019-09-08 05:39:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 05:39:06,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:06,780 INFO L399 BasicCegarLoop]: trace histogram [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:39:06,780 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:06,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:06,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1991538250, now seen corresponding path program 1 times [2019-09-08 05:39:06,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:06,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:06,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:06,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:06,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:39:06,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:06,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:39:06,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:39:06,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:39:06,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:39:06,941 INFO L87 Difference]: Start difference. First operand 223701 states and 332189 transitions. Second operand 3 states. [2019-09-08 05:39:19,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:19,053 INFO L93 Difference]: Finished difference Result 454819 states and 679873 transitions. [2019-09-08 05:39:19,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:39:19,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-09-08 05:39:19,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:20,084 INFO L225 Difference]: With dead ends: 454819 [2019-09-08 05:39:20,084 INFO L226 Difference]: Without dead ends: 231429 [2019-09-08 05:39:20,545 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:39:20,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231429 states. [2019-09-08 05:39:34,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231429 to 231381. [2019-09-08 05:39:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231381 states. [2019-09-08 05:39:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231381 states to 231381 states and 347837 transitions. [2019-09-08 05:39:36,539 INFO L78 Accepts]: Start accepts. Automaton has 231381 states and 347837 transitions. Word has length 242 [2019-09-08 05:39:36,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:36,540 INFO L475 AbstractCegarLoop]: Abstraction has 231381 states and 347837 transitions. [2019-09-08 05:39:36,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:39:36,540 INFO L276 IsEmpty]: Start isEmpty. Operand 231381 states and 347837 transitions. [2019-09-08 05:39:36,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 05:39:36,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:36,689 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:39:36,690 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:36,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:36,690 INFO L82 PathProgramCache]: Analyzing trace with hash 2022657308, now seen corresponding path program 1 times [2019-09-08 05:39:36,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:36,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:36,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:36,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:36,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:39:36,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:36,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:39:36,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:39:36,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:39:36,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:39:36,918 INFO L87 Difference]: Start difference. First operand 231381 states and 347837 transitions. Second operand 8 states. [2019-09-08 05:40:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:40:03,666 INFO L93 Difference]: Finished difference Result 699473 states and 1073733 transitions. [2019-09-08 05:40:03,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:40:03,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 249 [2019-09-08 05:40:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:40:12,783 INFO L225 Difference]: With dead ends: 699473 [2019-09-08 05:40:12,783 INFO L226 Difference]: Without dead ends: 468403 [2019-09-08 05:40:13,342 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:40:13,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468403 states. [2019-09-08 05:40:30,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468403 to 315309. [2019-09-08 05:40:30,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315309 states. [2019-09-08 05:40:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315309 states to 315309 states and 490370 transitions. [2019-09-08 05:40:33,483 INFO L78 Accepts]: Start accepts. Automaton has 315309 states and 490370 transitions. Word has length 249 [2019-09-08 05:40:33,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:40:33,484 INFO L475 AbstractCegarLoop]: Abstraction has 315309 states and 490370 transitions. [2019-09-08 05:40:33,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:40:33,484 INFO L276 IsEmpty]: Start isEmpty. Operand 315309 states and 490370 transitions. [2019-09-08 05:40:33,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 05:40:33,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:40:33,877 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:40:33,877 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:40:33,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:40:33,877 INFO L82 PathProgramCache]: Analyzing trace with hash 37915707, now seen corresponding path program 1 times [2019-09-08 05:40:33,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:40:33,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:40:33,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:33,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:33,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:34,085 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:40:34,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:40:34,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:40:34,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:40:34,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:40:34,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:40:34,087 INFO L87 Difference]: Start difference. First operand 315309 states and 490370 transitions. Second operand 8 states. [2019-09-08 05:41:19,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:19,354 INFO L93 Difference]: Finished difference Result 957689 states and 1533684 transitions. [2019-09-08 05:41:19,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:41:19,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 250 [2019-09-08 05:41:19,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:23,626 INFO L225 Difference]: With dead ends: 957689 [2019-09-08 05:41:23,627 INFO L226 Difference]: Without dead ends: 642691 [2019-09-08 05:41:24,418 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:41:24,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642691 states. [2019-09-08 05:42:04,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642691 to 472033. [2019-09-08 05:42:04,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472033 states. [2019-09-08 05:42:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472033 states to 472033 states and 770011 transitions. [2019-09-08 05:42:23,558 INFO L78 Accepts]: Start accepts. Automaton has 472033 states and 770011 transitions. Word has length 250 [2019-09-08 05:42:23,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:42:23,558 INFO L475 AbstractCegarLoop]: Abstraction has 472033 states and 770011 transitions. [2019-09-08 05:42:23,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:42:23,558 INFO L276 IsEmpty]: Start isEmpty. Operand 472033 states and 770011 transitions. [2019-09-08 05:42:24,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 05:42:24,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:42:24,396 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:42:24,396 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:42:24,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:42:24,397 INFO L82 PathProgramCache]: Analyzing trace with hash -584684617, now seen corresponding path program 1 times [2019-09-08 05:42:24,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:42:24,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:42:24,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:24,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:42:24,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:42:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 05:42:24,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:42:24,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:42:24,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:42:24,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:42:24,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:42:24,561 INFO L87 Difference]: Start difference. First operand 472033 states and 770011 transitions. Second operand 6 states. [2019-09-08 05:42:53,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:42:53,866 INFO L93 Difference]: Finished difference Result 943837 states and 1539711 transitions. [2019-09-08 05:42:53,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:42:53,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265 [2019-09-08 05:42:53,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:42:57,111 INFO L225 Difference]: With dead ends: 943837 [2019-09-08 05:42:57,112 INFO L226 Difference]: Without dead ends: 472115 [2019-09-08 05:42:58,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:42:58,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472115 states. [2019-09-08 05:43:39,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472115 to 428818. [2019-09-08 05:43:39,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428818 states. [2019-09-08 05:43:54,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428818 states to 428818 states and 706759 transitions. [2019-09-08 05:43:54,303 INFO L78 Accepts]: Start accepts. Automaton has 428818 states and 706759 transitions. Word has length 265 [2019-09-08 05:43:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:43:54,304 INFO L475 AbstractCegarLoop]: Abstraction has 428818 states and 706759 transitions. [2019-09-08 05:43:54,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:43:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 428818 states and 706759 transitions. [2019-09-08 05:43:57,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-08 05:43:57,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:43:57,330 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:43:57,330 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:43:57,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:43:57,331 INFO L82 PathProgramCache]: Analyzing trace with hash -682956680, now seen corresponding path program 1 times [2019-09-08 05:43:57,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:43:57,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:43:57,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:57,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:43:57,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:43:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:43:57,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:43:57,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:43:57,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:43:57,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:43:57,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:43:57,526 INFO L87 Difference]: Start difference. First operand 428818 states and 706759 transitions. Second operand 8 states. [2019-09-08 05:45:04,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:45:04,467 INFO L93 Difference]: Finished difference Result 1310024 states and 2247027 transitions. [2019-09-08 05:45:04,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:45:04,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 251 [2019-09-08 05:45:04,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:45:09,586 INFO L225 Difference]: With dead ends: 1310024 [2019-09-08 05:45:09,587 INFO L226 Difference]: Without dead ends: 881517 [2019-09-08 05:45:11,550 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:45:12,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881517 states.