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_spec11_product15.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:32:15,424 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:32:15,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:32:15,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:32:15,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:32:15,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:32:15,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:32:15,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:32:15,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:32:15,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:32:15,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:32:15,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:32:15,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:32:15,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:32:15,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:32:15,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:32:15,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:32:15,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:32:15,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:32:15,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:32:15,468 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:32:15,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:32:15,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:32:15,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:32:15,479 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:32:15,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:32:15,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:32:15,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:32:15,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:32:15,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:32:15,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:32:15,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:32:15,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:32:15,484 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:32:15,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:32:15,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:32:15,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:32:15,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:32:15,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:32:15,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:32:15,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:32:15,489 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 04:32:15,513 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:32:15,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:32:15,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:32:15,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:32:15,516 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:32:15,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:32:15,517 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:32:15,517 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:32:15,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:32:15,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:32:15,519 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:32:15,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:32:15,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:32:15,520 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:32:15,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:32:15,520 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:32:15,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:32:15,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:32:15,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:32:15,521 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:32:15,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:32:15,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:32:15,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:32:15,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:32:15,522 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:32:15,522 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:32:15,523 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:32:15,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:32:15,523 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:32:15,556 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:32:15,576 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:32:15,581 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:32:15,584 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:32:15,585 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:32:15,586 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec11_product15.cil.c [2019-09-08 04:32:15,648 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5459acddd/8706f873b5c14194b5db367a9e7776c1/FLAG5ee142a93 [2019-09-08 04:32:16,278 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:32:16,279 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec11_product15.cil.c [2019-09-08 04:32:16,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5459acddd/8706f873b5c14194b5db367a9e7776c1/FLAG5ee142a93 [2019-09-08 04:32:16,536 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5459acddd/8706f873b5c14194b5db367a9e7776c1 [2019-09-08 04:32:16,546 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:32:16,548 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:32:16,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:32:16,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:32:16,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:32:16,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:32:16" (1/1) ... [2019-09-08 04:32:16,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40945f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:16, skipping insertion in model container [2019-09-08 04:32:16,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:32:16" (1/1) ... [2019-09-08 04:32:16,564 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:32:16,634 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:32:17,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:32:17,433 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:32:17,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:32:17,715 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:32:17,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:17 WrapperNode [2019-09-08 04:32:17,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:32:17,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:32:17,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:32:17,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:32:17,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:17" (1/1) ... [2019-09-08 04:32:17,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:17" (1/1) ... [2019-09-08 04:32:17,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:17" (1/1) ... [2019-09-08 04:32:17,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:17" (1/1) ... [2019-09-08 04:32:17,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:17" (1/1) ... [2019-09-08 04:32:17,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:17" (1/1) ... [2019-09-08 04:32:17,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:17" (1/1) ... [2019-09-08 04:32:17,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:32:17,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:32:17,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:32:17,953 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:32:17,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:32:18,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:32:18,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:32:18,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:32:18,033 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 04:32:18,034 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 04:32:18,034 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 04:32:18,035 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 04:32:18,035 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 04:32:18,036 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 04:32:18,036 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 04:32:18,036 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 04:32:18,037 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 04:32:18,037 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 04:32:18,038 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 04:32:18,039 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 04:32:18,039 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 04:32:18,041 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 04:32:18,042 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 04:32:18,042 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 04:32:18,042 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 04:32:18,043 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 04:32:18,043 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 04:32:18,043 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 04:32:18,043 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 04:32:18,043 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-09-08 04:32:18,044 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 04:32:18,044 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 04:32:18,044 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 04:32:18,044 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 04:32:18,044 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 04:32:18,044 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AutoResponder [2019-09-08 04:32:18,045 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 04:32:18,045 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 04:32:18,045 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 04:32:18,045 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 04:32:18,045 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 04:32:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 04:32:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 04:32:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 04:32:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 04:32:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 04:32:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 04:32:18,047 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 04:32:18,047 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 04:32:18,047 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 04:32:18,047 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 04:32:18,047 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 04:32:18,048 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 04:32:18,048 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 04:32:18,048 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 04:32:18,048 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 04:32:18,048 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 04:32:18,048 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 04:32:18,049 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 04:32:18,049 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 04:32:18,049 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 04:32:18,049 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 04:32:18,049 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 04:32:18,049 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 04:32:18,050 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 04:32:18,051 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 04:32:18,051 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 04:32:18,051 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 04:32:18,051 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 04:32:18,051 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 04:32:18,051 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 04:32:18,052 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 04:32:18,052 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 04:32:18,052 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 04:32:18,053 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 04:32:18,053 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 04:32:18,053 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:32:18,053 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:32:18,053 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:32:18,054 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:32:18,054 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:32:18,055 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:32:18,055 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 04:32:18,055 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 04:32:18,055 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 04:32:18,055 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 04:32:18,055 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 04:32:18,056 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 04:32:18,056 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 04:32:18,057 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 04:32:18,057 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:32:18,057 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:32:18,058 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 04:32:18,058 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 04:32:18,058 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 04:32:18,059 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 04:32:18,059 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 04:32:18,059 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 04:32:18,060 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 04:32:18,060 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 04:32:18,060 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 04:32:18,060 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 04:32:18,060 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:32:18,060 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:32:18,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:32:18,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:32:18,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:32:18,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:32:18,061 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 04:32:18,062 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 04:32:18,062 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 04:32:18,062 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 04:32:18,062 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 04:32:18,062 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 04:32:18,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:32:18,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:32:18,063 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 04:32:18,063 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 04:32:18,063 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 04:32:18,064 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 04:32:18,064 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 04:32:18,064 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 04:32:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 04:32:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 04:32:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 04:32:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 04:32:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 04:32:18,066 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 04:32:18,066 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 04:32:18,066 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 04:32:18,066 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 04:32:18,066 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 04:32:18,066 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 04:32:18,067 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 04:32:18,067 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 04:32:18,067 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 04:32:18,068 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 04:32:18,068 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:32:18,069 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 04:32:18,069 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 04:32:18,069 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-09-08 04:32:18,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:32:18,069 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:32:18,070 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 04:32:18,070 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 04:32:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 04:32:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 04:32:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 04:32:18,076 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 04:32:18,081 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 04:32:18,081 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 04:32:18,082 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 04:32:18,082 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 04:32:18,082 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 04:32:18,082 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 04:32:18,082 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 04:32:18,082 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 04:32:18,082 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 04:32:18,082 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 04:32:18,083 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 04:32:18,083 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 04:32:18,083 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 04:32:18,083 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 04:32:18,084 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 04:32:18,084 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 04:32:18,084 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AutoResponder [2019-09-08 04:32:18,084 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 04:32:18,085 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 04:32:18,085 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 04:32:18,085 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 04:32:18,085 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 04:32:18,085 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 04:32:18,085 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 04:32:18,085 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 04:32:18,086 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 04:32:18,086 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 04:32:18,086 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 04:32:18,086 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 04:32:18,086 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 04:32:18,086 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 04:32:18,086 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 04:32:18,087 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 04:32:18,087 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 04:32:18,087 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 04:32:18,087 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 04:32:18,087 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 04:32:18,087 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 04:32:18,087 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 04:32:18,087 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 04:32:18,088 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 04:32:18,088 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 04:32:18,088 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 04:32:18,088 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 04:32:18,088 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 04:32:18,088 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 04:32:18,088 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 04:32:18,089 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 04:32:18,089 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 04:32:18,089 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 04:32:18,089 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:32:18,089 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:32:18,089 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:32:18,089 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:32:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:32:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 04:32:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 04:32:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 04:32:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 04:32:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:32:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:32:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 04:32:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 04:32:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 04:32:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 04:32:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 04:32:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:32:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:32:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:32:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:32:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:32:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:32:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:32:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:32:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:32:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:32:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:32:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:32:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:32:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:32:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:32:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:32:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 04:32:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 04:32:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 04:32:18,094 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 04:32:18,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:32:18,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:32:18,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:32:20,230 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:32:20,231 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 04:32:20,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:32:20 BoogieIcfgContainer [2019-09-08 04:32:20,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:32:20,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:32:20,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:32:20,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:32:20,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:32:16" (1/3) ... [2019-09-08 04:32:20,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3150b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:32:20, skipping insertion in model container [2019-09-08 04:32:20,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:17" (2/3) ... [2019-09-08 04:32:20,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3150b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:32:20, skipping insertion in model container [2019-09-08 04:32:20,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:32:20" (3/3) ... [2019-09-08 04:32:20,243 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec11_product15.cil.c [2019-09-08 04:32:20,254 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:32:20,269 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:32:20,288 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:32:20,348 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:32:20,349 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:32:20,349 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:32:20,349 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:32:20,349 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:32:20,349 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:32:20,349 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:32:20,350 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:32:20,350 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:32:20,389 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states. [2019-09-08 04:32:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 04:32:20,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:20,428 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:20,430 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:20,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:20,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1009460557, now seen corresponding path program 1 times [2019-09-08 04:32:20,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:20,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:20,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:20,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:20,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:32:21,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:21,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 04:32:21,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 04:32:21,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 04:32:21,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:32:21,053 INFO L87 Difference]: Start difference. First operand 463 states. Second operand 2 states. [2019-09-08 04:32:21,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:21,143 INFO L93 Difference]: Finished difference Result 642 states and 848 transitions. [2019-09-08 04:32:21,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 04:32:21,145 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 184 [2019-09-08 04:32:21,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:21,183 INFO L225 Difference]: With dead ends: 642 [2019-09-08 04:32:21,183 INFO L226 Difference]: Without dead ends: 427 [2019-09-08 04:32:21,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:32:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-08 04:32:21,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2019-09-08 04:32:21,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-08 04:32:21,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 567 transitions. [2019-09-08 04:32:21,353 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 567 transitions. Word has length 184 [2019-09-08 04:32:21,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:21,358 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 567 transitions. [2019-09-08 04:32:21,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 04:32:21,359 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 567 transitions. [2019-09-08 04:32:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 04:32:21,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:21,417 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:21,417 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:21,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:21,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1618025728, now seen corresponding path program 1 times [2019-09-08 04:32:21,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:21,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:21,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:21,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:21,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:32:21,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:21,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:32:21,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:32:21,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:32:21,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:21,656 INFO L87 Difference]: Start difference. First operand 427 states and 567 transitions. Second operand 3 states. [2019-09-08 04:32:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:21,696 INFO L93 Difference]: Finished difference Result 625 states and 814 transitions. [2019-09-08 04:32:21,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:32:21,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-08 04:32:21,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:21,701 INFO L225 Difference]: With dead ends: 625 [2019-09-08 04:32:21,702 INFO L226 Difference]: Without dead ends: 430 [2019-09-08 04:32:21,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:21,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-09-08 04:32:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 429. [2019-09-08 04:32:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-09-08 04:32:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 569 transitions. [2019-09-08 04:32:21,737 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 569 transitions. Word has length 185 [2019-09-08 04:32:21,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:21,738 INFO L475 AbstractCegarLoop]: Abstraction has 429 states and 569 transitions. [2019-09-08 04:32:21,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:32:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 569 transitions. [2019-09-08 04:32:21,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 04:32:21,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:21,743 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:21,743 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:21,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:21,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1065076368, now seen corresponding path program 1 times [2019-09-08 04:32:21,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:21,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:21,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:21,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:21,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:32:22,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:22,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:32:22,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:32:22,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:32:22,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:22,022 INFO L87 Difference]: Start difference. First operand 429 states and 569 transitions. Second operand 3 states. [2019-09-08 04:32:22,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:22,070 INFO L93 Difference]: Finished difference Result 834 states and 1136 transitions. [2019-09-08 04:32:22,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:32:22,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-09-08 04:32:22,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:22,080 INFO L225 Difference]: With dead ends: 834 [2019-09-08 04:32:22,080 INFO L226 Difference]: Without dead ends: 470 [2019-09-08 04:32:22,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:22,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-08 04:32:22,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 469. [2019-09-08 04:32:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-09-08 04:32:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 638 transitions. [2019-09-08 04:32:22,115 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 638 transitions. Word has length 195 [2019-09-08 04:32:22,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:22,117 INFO L475 AbstractCegarLoop]: Abstraction has 469 states and 638 transitions. [2019-09-08 04:32:22,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:32:22,117 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 638 transitions. [2019-09-08 04:32:22,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 04:32:22,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:22,125 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:22,126 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:22,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:22,126 INFO L82 PathProgramCache]: Analyzing trace with hash 328316479, now seen corresponding path program 1 times [2019-09-08 04:32:22,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:22,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:22,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:22,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:22,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:22,372 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:32:22,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:22,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:32:22,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:32:22,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:32:22,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:22,375 INFO L87 Difference]: Start difference. First operand 469 states and 638 transitions. Second operand 3 states. [2019-09-08 04:32:22,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:22,427 INFO L93 Difference]: Finished difference Result 951 states and 1338 transitions. [2019-09-08 04:32:22,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:32:22,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-09-08 04:32:22,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:22,436 INFO L225 Difference]: With dead ends: 951 [2019-09-08 04:32:22,436 INFO L226 Difference]: Without dead ends: 547 [2019-09-08 04:32:22,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:22,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-08 04:32:22,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 546. [2019-09-08 04:32:22,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-09-08 04:32:22,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 770 transitions. [2019-09-08 04:32:22,470 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 770 transitions. Word has length 196 [2019-09-08 04:32:22,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:22,472 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 770 transitions. [2019-09-08 04:32:22,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:32:22,472 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 770 transitions. [2019-09-08 04:32:22,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-08 04:32:22,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:22,479 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:22,479 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:22,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:22,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1785624336, now seen corresponding path program 1 times [2019-09-08 04:32:22,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:22,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:22,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:22,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:22,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:22,659 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:32:22,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:22,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:32:22,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:32:22,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:32:22,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:22,662 INFO L87 Difference]: Start difference. First operand 546 states and 770 transitions. Second operand 3 states. [2019-09-08 04:32:22,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:22,709 INFO L93 Difference]: Finished difference Result 1176 states and 1724 transitions. [2019-09-08 04:32:22,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:32:22,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-09-08 04:32:22,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:22,715 INFO L225 Difference]: With dead ends: 1176 [2019-09-08 04:32:22,715 INFO L226 Difference]: Without dead ends: 695 [2019-09-08 04:32:22,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:22,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-09-08 04:32:22,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 694. [2019-09-08 04:32:22,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-09-08 04:32:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1022 transitions. [2019-09-08 04:32:22,761 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1022 transitions. Word has length 197 [2019-09-08 04:32:22,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:22,761 INFO L475 AbstractCegarLoop]: Abstraction has 694 states and 1022 transitions. [2019-09-08 04:32:22,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:32:22,762 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1022 transitions. [2019-09-08 04:32:22,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-08 04:32:22,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:22,767 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:22,767 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:22,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:22,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1999560001, now seen corresponding path program 1 times [2019-09-08 04:32:22,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:22,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:22,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:22,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:22,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:22,959 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:32:22,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:22,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:32:22,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:32:22,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:32:22,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:22,960 INFO L87 Difference]: Start difference. First operand 694 states and 1022 transitions. Second operand 3 states. [2019-09-08 04:32:23,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:23,005 INFO L93 Difference]: Finished difference Result 1608 states and 2460 transitions. [2019-09-08 04:32:23,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:32:23,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-09-08 04:32:23,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:23,012 INFO L225 Difference]: With dead ends: 1608 [2019-09-08 04:32:23,012 INFO L226 Difference]: Without dead ends: 979 [2019-09-08 04:32:23,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2019-09-08 04:32:23,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 978. [2019-09-08 04:32:23,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2019-09-08 04:32:23,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1502 transitions. [2019-09-08 04:32:23,064 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1502 transitions. Word has length 198 [2019-09-08 04:32:23,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:23,065 INFO L475 AbstractCegarLoop]: Abstraction has 978 states and 1502 transitions. [2019-09-08 04:32:23,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:32:23,065 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1502 transitions. [2019-09-08 04:32:23,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-08 04:32:23,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:23,074 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:23,074 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:23,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:23,075 INFO L82 PathProgramCache]: Analyzing trace with hash 164433568, now seen corresponding path program 1 times [2019-09-08 04:32:23,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:23,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:23,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:23,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:23,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:32:23,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:23,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 04:32:23,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 04:32:23,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 04:32:23,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:32:23,499 INFO L87 Difference]: Start difference. First operand 978 states and 1502 transitions. Second operand 19 states. [2019-09-08 04:32:27,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:27,567 INFO L93 Difference]: Finished difference Result 2535 states and 3849 transitions. [2019-09-08 04:32:27,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 04:32:27,568 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 201 [2019-09-08 04:32:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:27,585 INFO L225 Difference]: With dead ends: 2535 [2019-09-08 04:32:27,585 INFO L226 Difference]: Without dead ends: 2353 [2019-09-08 04:32:27,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 04:32:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2019-09-08 04:32:27,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2316. [2019-09-08 04:32:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2316 states. [2019-09-08 04:32:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 3563 transitions. [2019-09-08 04:32:27,720 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 3563 transitions. Word has length 201 [2019-09-08 04:32:27,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:27,721 INFO L475 AbstractCegarLoop]: Abstraction has 2316 states and 3563 transitions. [2019-09-08 04:32:27,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 04:32:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 3563 transitions. [2019-09-08 04:32:27,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 04:32:27,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:27,734 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:27,734 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:27,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:27,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1129710859, now seen corresponding path program 1 times [2019-09-08 04:32:27,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:27,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:27,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:27,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:27,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:32:27,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:27,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:32:27,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:32:27,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:32:27,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:32:27,999 INFO L87 Difference]: Start difference. First operand 2316 states and 3563 transitions. Second operand 9 states. [2019-09-08 04:32:28,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:28,385 INFO L93 Difference]: Finished difference Result 3149 states and 4658 transitions. [2019-09-08 04:32:28,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:32:28,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 202 [2019-09-08 04:32:28,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:28,404 INFO L225 Difference]: With dead ends: 3149 [2019-09-08 04:32:28,404 INFO L226 Difference]: Without dead ends: 2362 [2019-09-08 04:32:28,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:32:28,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-09-08 04:32:28,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2362. [2019-09-08 04:32:28,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2362 states. [2019-09-08 04:32:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 3636 transitions. [2019-09-08 04:32:28,551 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 3636 transitions. Word has length 202 [2019-09-08 04:32:28,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:28,554 INFO L475 AbstractCegarLoop]: Abstraction has 2362 states and 3636 transitions. [2019-09-08 04:32:28,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:32:28,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 3636 transitions. [2019-09-08 04:32:28,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 04:32:28,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:28,576 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:28,577 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:28,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:28,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1961451491, now seen corresponding path program 1 times [2019-09-08 04:32:28,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:28,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:28,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:28,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:28,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 04:32:28,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:28,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 04:32:28,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:32:28,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:32:28,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:32:28,837 INFO L87 Difference]: Start difference. First operand 2362 states and 3636 transitions. Second operand 14 states. [2019-09-08 04:32:29,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:29,197 INFO L93 Difference]: Finished difference Result 3233 states and 4784 transitions. [2019-09-08 04:32:29,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:32:29,197 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 202 [2019-09-08 04:32:29,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:29,265 INFO L225 Difference]: With dead ends: 3233 [2019-09-08 04:32:29,266 INFO L226 Difference]: Without dead ends: 2394 [2019-09-08 04:32:29,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:32:29,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2019-09-08 04:32:29,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2394. [2019-09-08 04:32:29,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2394 states. [2019-09-08 04:32:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 3668 transitions. [2019-09-08 04:32:29,405 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 3668 transitions. Word has length 202 [2019-09-08 04:32:29,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:29,406 INFO L475 AbstractCegarLoop]: Abstraction has 2394 states and 3668 transitions. [2019-09-08 04:32:29,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 04:32:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 3668 transitions. [2019-09-08 04:32:29,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 04:32:29,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:29,425 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:29,425 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:29,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:29,426 INFO L82 PathProgramCache]: Analyzing trace with hash 193335460, now seen corresponding path program 1 times [2019-09-08 04:32:29,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:29,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:29,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:29,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:29,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:29,785 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:32:29,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:29,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 04:32:29,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 04:32:29,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 04:32:29,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:32:29,788 INFO L87 Difference]: Start difference. First operand 2394 states and 3668 transitions. Second operand 15 states. [2019-09-08 04:32:33,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:33,169 INFO L93 Difference]: Finished difference Result 3273 states and 4819 transitions. [2019-09-08 04:32:33,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 04:32:33,170 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 202 [2019-09-08 04:32:33,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:33,190 INFO L225 Difference]: With dead ends: 3273 [2019-09-08 04:32:33,190 INFO L226 Difference]: Without dead ends: 2478 [2019-09-08 04:32:33,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 04:32:33,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2019-09-08 04:32:33,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2423. [2019-09-08 04:32:33,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-09-08 04:32:33,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 3711 transitions. [2019-09-08 04:32:33,326 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 3711 transitions. Word has length 202 [2019-09-08 04:32:33,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:33,327 INFO L475 AbstractCegarLoop]: Abstraction has 2423 states and 3711 transitions. [2019-09-08 04:32:33,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 04:32:33,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 3711 transitions. [2019-09-08 04:32:33,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 04:32:33,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:33,338 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:33,339 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:33,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:33,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1971016039, now seen corresponding path program 1 times [2019-09-08 04:32:33,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:33,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:33,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:33,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:33,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:32:33,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:33,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:32:33,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:32:33,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:32:33,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:32:33,510 INFO L87 Difference]: Start difference. First operand 2423 states and 3711 transitions. Second operand 5 states. [2019-09-08 04:32:34,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:34,488 INFO L93 Difference]: Finished difference Result 4799 states and 7182 transitions. [2019-09-08 04:32:34,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:32:34,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 202 [2019-09-08 04:32:34,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:34,522 INFO L225 Difference]: With dead ends: 4799 [2019-09-08 04:32:34,522 INFO L226 Difference]: Without dead ends: 4396 [2019-09-08 04:32:34,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:32:34,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4396 states. [2019-09-08 04:32:34,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4396 to 4365. [2019-09-08 04:32:34,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4365 states. [2019-09-08 04:32:34,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4365 states to 4365 states and 6623 transitions. [2019-09-08 04:32:34,770 INFO L78 Accepts]: Start accepts. Automaton has 4365 states and 6623 transitions. Word has length 202 [2019-09-08 04:32:34,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:34,772 INFO L475 AbstractCegarLoop]: Abstraction has 4365 states and 6623 transitions. [2019-09-08 04:32:34,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:32:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 4365 states and 6623 transitions. [2019-09-08 04:32:34,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 04:32:34,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:34,790 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:34,790 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:34,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:34,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1840275930, now seen corresponding path program 1 times [2019-09-08 04:32:34,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:34,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:34,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:34,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:34,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:32:35,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:35,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:32:35,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:32:35,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:32:35,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:32:35,027 INFO L87 Difference]: Start difference. First operand 4365 states and 6623 transitions. Second operand 7 states. [2019-09-08 04:32:36,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:36,632 INFO L93 Difference]: Finished difference Result 10441 states and 14838 transitions. [2019-09-08 04:32:36,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:32:36,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 202 [2019-09-08 04:32:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:36,715 INFO L225 Difference]: With dead ends: 10441 [2019-09-08 04:32:36,715 INFO L226 Difference]: Without dead ends: 8499 [2019-09-08 04:32:36,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:32:36,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8499 states. [2019-09-08 04:32:37,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8499 to 8461. [2019-09-08 04:32:37,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-09-08 04:32:37,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 12143 transitions. [2019-09-08 04:32:37,140 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 12143 transitions. Word has length 202 [2019-09-08 04:32:37,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:37,140 INFO L475 AbstractCegarLoop]: Abstraction has 8461 states and 12143 transitions. [2019-09-08 04:32:37,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:32:37,141 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 12143 transitions. [2019-09-08 04:32:37,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-08 04:32:37,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:37,161 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:37,162 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:37,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:37,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1975708119, now seen corresponding path program 1 times [2019-09-08 04:32:37,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:37,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:37,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:37,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:37,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:37,607 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:32:37,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:37,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 04:32:37,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 04:32:37,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 04:32:37,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-09-08 04:32:37,609 INFO L87 Difference]: Start difference. First operand 8461 states and 12143 transitions. Second operand 24 states. [2019-09-08 04:32:38,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:38,523 INFO L93 Difference]: Finished difference Result 15254 states and 21358 transitions. [2019-09-08 04:32:38,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 04:32:38,524 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 203 [2019-09-08 04:32:38,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:38,569 INFO L225 Difference]: With dead ends: 15254 [2019-09-08 04:32:38,569 INFO L226 Difference]: Without dead ends: 8814 [2019-09-08 04:32:38,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 04:32:38,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8814 states. [2019-09-08 04:32:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8814 to 8591. [2019-09-08 04:32:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8591 states. [2019-09-08 04:32:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8591 states to 8591 states and 12329 transitions. [2019-09-08 04:32:38,983 INFO L78 Accepts]: Start accepts. Automaton has 8591 states and 12329 transitions. Word has length 203 [2019-09-08 04:32:38,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:38,984 INFO L475 AbstractCegarLoop]: Abstraction has 8591 states and 12329 transitions. [2019-09-08 04:32:38,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 04:32:38,984 INFO L276 IsEmpty]: Start isEmpty. Operand 8591 states and 12329 transitions. [2019-09-08 04:32:39,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-08 04:32:39,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:39,007 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:39,007 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:39,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:39,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1635585549, now seen corresponding path program 1 times [2019-09-08 04:32:39,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:39,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:39,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:39,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:39,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:32:39,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:39,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:32:39,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:32:39,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:32:39,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:32:39,197 INFO L87 Difference]: Start difference. First operand 8591 states and 12329 transitions. Second operand 10 states. [2019-09-08 04:32:39,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:39,395 INFO L93 Difference]: Finished difference Result 8656 states and 12393 transitions. [2019-09-08 04:32:39,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:32:39,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 207 [2019-09-08 04:32:39,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:39,432 INFO L225 Difference]: With dead ends: 8656 [2019-09-08 04:32:39,432 INFO L226 Difference]: Without dead ends: 8442 [2019-09-08 04:32:39,441 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 04:32:39,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8442 states. [2019-09-08 04:32:39,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8442 to 8438. [2019-09-08 04:32:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8438 states. [2019-09-08 04:32:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8438 states to 8438 states and 12096 transitions. [2019-09-08 04:32:39,884 INFO L78 Accepts]: Start accepts. Automaton has 8438 states and 12096 transitions. Word has length 207 [2019-09-08 04:32:39,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:39,884 INFO L475 AbstractCegarLoop]: Abstraction has 8438 states and 12096 transitions. [2019-09-08 04:32:39,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:32:39,885 INFO L276 IsEmpty]: Start isEmpty. Operand 8438 states and 12096 transitions. [2019-09-08 04:32:39,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 04:32:39,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:39,905 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:39,905 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:39,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:39,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1032859762, now seen corresponding path program 1 times [2019-09-08 04:32:39,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:39,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:39,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:39,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:39,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:32:40,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:40,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:32:40,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:32:40,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:32:40,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:32:40,045 INFO L87 Difference]: Start difference. First operand 8438 states and 12096 transitions. Second operand 5 states. [2019-09-08 04:32:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:40,304 INFO L93 Difference]: Finished difference Result 12964 states and 17977 transitions. [2019-09-08 04:32:40,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:32:40,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-09-08 04:32:40,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:40,350 INFO L225 Difference]: With dead ends: 12964 [2019-09-08 04:32:40,350 INFO L226 Difference]: Without dead ends: 8621 [2019-09-08 04:32:40,374 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 04:32:40,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8621 states. [2019-09-08 04:32:40,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8621 to 8516. [2019-09-08 04:32:40,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8516 states. [2019-09-08 04:32:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8516 states to 8516 states and 12137 transitions. [2019-09-08 04:32:40,813 INFO L78 Accepts]: Start accepts. Automaton has 8516 states and 12137 transitions. Word has length 212 [2019-09-08 04:32:40,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:40,814 INFO L475 AbstractCegarLoop]: Abstraction has 8516 states and 12137 transitions. [2019-09-08 04:32:40,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:32:40,814 INFO L276 IsEmpty]: Start isEmpty. Operand 8516 states and 12137 transitions. [2019-09-08 04:32:40,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-08 04:32:40,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:40,840 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:40,840 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:40,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:40,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1398950784, now seen corresponding path program 1 times [2019-09-08 04:32:40,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:40,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:40,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:40,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:40,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:41,560 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:32:41,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:41,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:32:41,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:32:41,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:32:41,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:32:41,562 INFO L87 Difference]: Start difference. First operand 8516 states and 12137 transitions. Second operand 5 states. [2019-09-08 04:32:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:41,761 INFO L93 Difference]: Finished difference Result 12510 states and 17250 transitions. [2019-09-08 04:32:41,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:32:41,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 214 [2019-09-08 04:32:41,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:41,793 INFO L225 Difference]: With dead ends: 12510 [2019-09-08 04:32:41,793 INFO L226 Difference]: Without dead ends: 7178 [2019-09-08 04:32:41,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:32:41,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7178 states. [2019-09-08 04:32:42,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7178 to 7168. [2019-09-08 04:32:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7168 states. [2019-09-08 04:32:42,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7168 states to 7168 states and 10326 transitions. [2019-09-08 04:32:42,120 INFO L78 Accepts]: Start accepts. Automaton has 7168 states and 10326 transitions. Word has length 214 [2019-09-08 04:32:42,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:42,121 INFO L475 AbstractCegarLoop]: Abstraction has 7168 states and 10326 transitions. [2019-09-08 04:32:42,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:32:42,121 INFO L276 IsEmpty]: Start isEmpty. Operand 7168 states and 10326 transitions. [2019-09-08 04:32:42,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 04:32:42,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:42,145 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:42,146 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:42,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:42,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1647701080, now seen corresponding path program 1 times [2019-09-08 04:32:42,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:42,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:42,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:42,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:42,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:42,325 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:32:42,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:42,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:32:42,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:32:42,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:32:42,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:32:42,327 INFO L87 Difference]: Start difference. First operand 7168 states and 10326 transitions. Second operand 6 states. [2019-09-08 04:32:43,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:43,091 INFO L93 Difference]: Finished difference Result 18402 states and 26277 transitions. [2019-09-08 04:32:43,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:32:43,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 213 [2019-09-08 04:32:43,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:43,145 INFO L225 Difference]: With dead ends: 18402 [2019-09-08 04:32:43,145 INFO L226 Difference]: Without dead ends: 14369 [2019-09-08 04:32:43,163 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 04:32:43,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14369 states. [2019-09-08 04:32:43,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14369 to 14191. [2019-09-08 04:32:43,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14191 states. [2019-09-08 04:32:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14191 states to 14191 states and 20810 transitions. [2019-09-08 04:32:43,788 INFO L78 Accepts]: Start accepts. Automaton has 14191 states and 20810 transitions. Word has length 213 [2019-09-08 04:32:43,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:43,789 INFO L475 AbstractCegarLoop]: Abstraction has 14191 states and 20810 transitions. [2019-09-08 04:32:43,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:32:43,789 INFO L276 IsEmpty]: Start isEmpty. Operand 14191 states and 20810 transitions. [2019-09-08 04:32:43,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-08 04:32:43,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:43,828 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:43,828 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:43,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:43,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1801570746, now seen corresponding path program 1 times [2019-09-08 04:32:43,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:43,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:43,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:43,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:43,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:32:44,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:44,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:32:44,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:32:44,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:32:44,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:32:44,023 INFO L87 Difference]: Start difference. First operand 14191 states and 20810 transitions. Second operand 8 states. [2019-09-08 04:32:48,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:48,497 INFO L93 Difference]: Finished difference Result 43187 states and 68176 transitions. [2019-09-08 04:32:48,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:32:48,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 234 [2019-09-08 04:32:48,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:48,652 INFO L225 Difference]: With dead ends: 43187 [2019-09-08 04:32:48,652 INFO L226 Difference]: Without dead ends: 29061 [2019-09-08 04:32:48,741 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 04:32:48,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29061 states. [2019-09-08 04:32:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29061 to 26447. [2019-09-08 04:32:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26447 states. [2019-09-08 04:32:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26447 states to 26447 states and 41664 transitions. [2019-09-08 04:32:51,189 INFO L78 Accepts]: Start accepts. Automaton has 26447 states and 41664 transitions. Word has length 234 [2019-09-08 04:32:51,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:51,190 INFO L475 AbstractCegarLoop]: Abstraction has 26447 states and 41664 transitions. [2019-09-08 04:32:51,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:32:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 26447 states and 41664 transitions. [2019-09-08 04:32:51,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 04:32:51,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:51,270 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:51,270 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:51,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:51,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1837657716, now seen corresponding path program 1 times [2019-09-08 04:32:51,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:51,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:51,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:51,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:51,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:51,496 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 04:32:51,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:51,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:32:51,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:32:51,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:32:51,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:32:51,499 INFO L87 Difference]: Start difference. First operand 26447 states and 41664 transitions. Second operand 8 states. [2019-09-08 04:32:56,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:56,918 INFO L93 Difference]: Finished difference Result 80759 states and 136798 transitions. [2019-09-08 04:32:56,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:32:56,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 250 [2019-09-08 04:32:56,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:57,192 INFO L225 Difference]: With dead ends: 80759 [2019-09-08 04:32:57,193 INFO L226 Difference]: Without dead ends: 54377 [2019-09-08 04:32:57,298 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 04:32:57,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54377 states. [2019-09-08 04:32:59,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54377 to 49429. [2019-09-08 04:32:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49429 states. [2019-09-08 04:33:00,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49429 states to 49429 states and 83743 transitions. [2019-09-08 04:33:00,029 INFO L78 Accepts]: Start accepts. Automaton has 49429 states and 83743 transitions. Word has length 250 [2019-09-08 04:33:00,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:33:00,029 INFO L475 AbstractCegarLoop]: Abstraction has 49429 states and 83743 transitions. [2019-09-08 04:33:00,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:33:00,030 INFO L276 IsEmpty]: Start isEmpty. Operand 49429 states and 83743 transitions. [2019-09-08 04:33:00,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-08 04:33:00,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:33:00,153 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:33:00,153 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:33:00,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:33:00,154 INFO L82 PathProgramCache]: Analyzing trace with hash 870001194, now seen corresponding path program 1 times [2019-09-08 04:33:00,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:33:00,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:33:00,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:00,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:33:00,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:33:00,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:33:00,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:33:00,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:33:00,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:33:00,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:33:00,340 INFO L87 Difference]: Start difference. First operand 49429 states and 83743 transitions. Second operand 8 states. [2019-09-08 04:33:06,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:33:06,881 INFO L93 Difference]: Finished difference Result 151181 states and 275089 transitions. [2019-09-08 04:33:06,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:33:06,885 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 236 [2019-09-08 04:33:06,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:33:07,815 INFO L225 Difference]: With dead ends: 151181 [2019-09-08 04:33:07,815 INFO L226 Difference]: Without dead ends: 101817 [2019-09-08 04:33:07,978 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 04:33:08,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101817 states. [2019-09-08 04:33:15,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101817 to 89175. [2019-09-08 04:33:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89175 states. [2019-09-08 04:33:15,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89175 states to 89175 states and 164593 transitions. [2019-09-08 04:33:15,560 INFO L78 Accepts]: Start accepts. Automaton has 89175 states and 164593 transitions. Word has length 236 [2019-09-08 04:33:15,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:33:15,561 INFO L475 AbstractCegarLoop]: Abstraction has 89175 states and 164593 transitions. [2019-09-08 04:33:15,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:33:15,561 INFO L276 IsEmpty]: Start isEmpty. Operand 89175 states and 164593 transitions. [2019-09-08 04:33:15,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 04:33:15,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:33:15,781 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:33:15,781 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:33:15,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:33:15,782 INFO L82 PathProgramCache]: Analyzing trace with hash -597043004, now seen corresponding path program 1 times [2019-09-08 04:33:15,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:33:15,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:33:15,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:15,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:33:15,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 04:33:15,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:33:15,966 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:33:15,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:33:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:16,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 2688 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:33:16,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:33:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:33:16,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:33:16,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2019-09-08 04:33:16,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:33:16,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:33:16,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:33:16,691 INFO L87 Difference]: Start difference. First operand 89175 states and 164593 transitions. Second operand 13 states. [2019-09-08 04:33:24,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:33:24,744 INFO L93 Difference]: Finished difference Result 180229 states and 331354 transitions. [2019-09-08 04:33:24,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 04:33:24,745 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 232 [2019-09-08 04:33:24,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:33:25,361 INFO L225 Difference]: With dead ends: 180229 [2019-09-08 04:33:25,361 INFO L226 Difference]: Without dead ends: 90731 [2019-09-08 04:33:25,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:33:25,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90731 states. [2019-09-08 04:33:33,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90731 to 86716. [2019-09-08 04:33:33,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86716 states. [2019-09-08 04:33:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86716 states to 86716 states and 159983 transitions. [2019-09-08 04:33:34,191 INFO L78 Accepts]: Start accepts. Automaton has 86716 states and 159983 transitions. Word has length 232 [2019-09-08 04:33:34,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:33:34,192 INFO L475 AbstractCegarLoop]: Abstraction has 86716 states and 159983 transitions. [2019-09-08 04:33:34,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:33:34,192 INFO L276 IsEmpty]: Start isEmpty. Operand 86716 states and 159983 transitions. [2019-09-08 04:33:34,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-08 04:33:34,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:33:34,446 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:33:34,447 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:33:34,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:33:34,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1471484019, now seen corresponding path program 1 times [2019-09-08 04:33:34,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:33:34,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:33:34,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:34,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:33:34,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-08 04:33:34,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:33:34,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:33:34,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:33:34,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:33:34,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:33:34,640 INFO L87 Difference]: Start difference. First operand 86716 states and 159983 transitions. Second operand 6 states. [2019-09-08 04:33:42,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:33:42,508 INFO L93 Difference]: Finished difference Result 217444 states and 375926 transitions. [2019-09-08 04:33:42,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:33:42,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 258 [2019-09-08 04:33:42,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:33:43,409 INFO L225 Difference]: With dead ends: 217444 [2019-09-08 04:33:43,409 INFO L226 Difference]: Without dead ends: 174493 [2019-09-08 04:33:43,511 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 04:33:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174493 states. [2019-09-08 04:33:54,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174493 to 169056. [2019-09-08 04:33:54,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169056 states. [2019-09-08 04:33:55,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169056 states to 169056 states and 314548 transitions. [2019-09-08 04:33:55,542 INFO L78 Accepts]: Start accepts. Automaton has 169056 states and 314548 transitions. Word has length 258 [2019-09-08 04:33:55,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:33:55,543 INFO L475 AbstractCegarLoop]: Abstraction has 169056 states and 314548 transitions. [2019-09-08 04:33:55,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:33:55,543 INFO L276 IsEmpty]: Start isEmpty. Operand 169056 states and 314548 transitions. [2019-09-08 04:33:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 04:33:56,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:33:56,041 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:33:56,041 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:33:56,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:33:56,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1481762678, now seen corresponding path program 1 times [2019-09-08 04:33:56,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:33:56,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:33:56,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:56,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:33:56,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:56,418 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:33:56,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:33:56,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 04:33:56,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 04:33:56,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 04:33:56,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:33:56,421 INFO L87 Difference]: Start difference. First operand 169056 states and 314548 transitions. Second operand 19 states. [2019-09-08 04:34:08,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:34:08,516 INFO L93 Difference]: Finished difference Result 210386 states and 400722 transitions. [2019-09-08 04:34:08,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 04:34:08,517 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 242 [2019-09-08 04:34:08,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:34:09,419 INFO L225 Difference]: With dead ends: 210386 [2019-09-08 04:34:09,419 INFO L226 Difference]: Without dead ends: 206386 [2019-09-08 04:34:09,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=214, Invalid=2042, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 04:34:09,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206386 states. [2019-09-08 04:34:20,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206386 to 204354. [2019-09-08 04:34:20,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204354 states. [2019-09-08 04:34:28,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204354 states to 204354 states and 393044 transitions. [2019-09-08 04:34:28,819 INFO L78 Accepts]: Start accepts. Automaton has 204354 states and 393044 transitions. Word has length 242 [2019-09-08 04:34:28,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:34:28,820 INFO L475 AbstractCegarLoop]: Abstraction has 204354 states and 393044 transitions. [2019-09-08 04:34:28,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 04:34:28,820 INFO L276 IsEmpty]: Start isEmpty. Operand 204354 states and 393044 transitions. [2019-09-08 04:34:29,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-08 04:34:29,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:34:29,416 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:34:29,416 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:34:29,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:34:29,416 INFO L82 PathProgramCache]: Analyzing trace with hash -2076249645, now seen corresponding path program 1 times [2019-09-08 04:34:29,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:34:29,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:34:29,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:29,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:29,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:29,563 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:34:29,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:34:29,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:34:29,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:34:29,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:34:29,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:34:29,565 INFO L87 Difference]: Start difference. First operand 204354 states and 393044 transitions. Second operand 7 states. [2019-09-08 04:34:48,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:34:48,293 INFO L93 Difference]: Finished difference Result 438697 states and 956223 transitions. [2019-09-08 04:34:48,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:34:48,294 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 243 [2019-09-08 04:34:48,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:34:50,172 INFO L225 Difference]: With dead ends: 438697 [2019-09-08 04:34:50,172 INFO L226 Difference]: Without dead ends: 399122 [2019-09-08 04:34:50,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:34:50,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399122 states. [2019-09-08 04:35:37,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399122 to 380942. [2019-09-08 04:35:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380942 states. [2019-09-08 04:35:39,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380942 states to 380942 states and 882796 transitions. [2019-09-08 04:35:39,981 INFO L78 Accepts]: Start accepts. Automaton has 380942 states and 882796 transitions. Word has length 243 [2019-09-08 04:35:39,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:35:39,981 INFO L475 AbstractCegarLoop]: Abstraction has 380942 states and 882796 transitions. [2019-09-08 04:35:39,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:35:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 380942 states and 882796 transitions. [2019-09-08 04:35:43,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 04:35:43,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:35:43,308 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:35:43,309 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:35:43,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:35:43,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1642931679, now seen corresponding path program 1 times [2019-09-08 04:35:43,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:35:43,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:35:43,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:43,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:35:43,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:35:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:35:43,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:35:43,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:35:43,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:35:43,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:35:43,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:35:43,483 INFO L87 Difference]: Start difference. First operand 380942 states and 882796 transitions. Second operand 9 states. [2019-09-08 04:36:04,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:36:04,048 INFO L93 Difference]: Finished difference Result 505333 states and 1045539 transitions. [2019-09-08 04:36:04,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:36:04,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 245 [2019-09-08 04:36:04,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:36:05,941 INFO L225 Difference]: With dead ends: 505333 [2019-09-08 04:36:05,941 INFO L226 Difference]: Without dead ends: 395255 [2019-09-08 04:36:06,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:36:06,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395255 states. [2019-09-08 04:36:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395255 to 371495. [2019-09-08 04:36:43,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371495 states. [2019-09-08 04:36:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371495 states to 371495 states and 873930 transitions. [2019-09-08 04:36:56,590 INFO L78 Accepts]: Start accepts. Automaton has 371495 states and 873930 transitions. Word has length 245 [2019-09-08 04:36:56,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:36:56,591 INFO L475 AbstractCegarLoop]: Abstraction has 371495 states and 873930 transitions. [2019-09-08 04:36:56,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:36:56,591 INFO L276 IsEmpty]: Start isEmpty. Operand 371495 states and 873930 transitions. [2019-09-08 04:37:00,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 04:37:00,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:37:00,320 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:37:00,320 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:37:00,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:37:00,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1744248655, now seen corresponding path program 1 times [2019-09-08 04:37:00,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:37:00,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:37:00,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:37:00,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:37:00,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:37:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:37:00,478 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 04:37:00,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:37:00,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:37:00,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:37:00,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:37:00,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:37:00,480 INFO L87 Difference]: Start difference. First operand 371495 states and 873930 transitions. Second operand 6 states. [2019-09-08 04:37:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:37:24,562 INFO L93 Difference]: Finished difference Result 744125 states and 1874722 transitions. [2019-09-08 04:37:24,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:37:24,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 262 [2019-09-08 04:37:24,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:37:27,868 INFO L225 Difference]: With dead ends: 744125 [2019-09-08 04:37:27,868 INFO L226 Difference]: Without dead ends: 372707 [2019-09-08 04:37:41,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:37:41,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372707 states. [2019-09-08 04:38:11,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372707 to 365270. [2019-09-08 04:38:11,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365270 states. [2019-09-08 04:38:13,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365270 states to 365270 states and 742029 transitions. [2019-09-08 04:38:13,959 INFO L78 Accepts]: Start accepts. Automaton has 365270 states and 742029 transitions. Word has length 262 [2019-09-08 04:38:13,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:38:13,959 INFO L475 AbstractCegarLoop]: Abstraction has 365270 states and 742029 transitions. [2019-09-08 04:38:13,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:38:13,960 INFO L276 IsEmpty]: Start isEmpty. Operand 365270 states and 742029 transitions. [2019-09-08 04:38:16,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 04:38:16,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:38:16,754 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:38:16,755 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:38:16,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:38:16,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1175813459, now seen corresponding path program 1 times [2019-09-08 04:38:16,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:38:16,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:38:16,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:38:16,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:38:16,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:38:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:38:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-08 04:38:16,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:38:16,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:38:16,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:38:16,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:38:16,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:38:16,890 INFO L87 Difference]: Start difference. First operand 365270 states and 742029 transitions. Second operand 4 states. [2019-09-08 04:38:33,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:38:33,940 INFO L93 Difference]: Finished difference Result 539013 states and 1144187 transitions. [2019-09-08 04:38:33,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:38:33,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2019-09-08 04:38:33,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:38:34,783 INFO L225 Difference]: With dead ends: 539013 [2019-09-08 04:38:34,783 INFO L226 Difference]: Without dead ends: 172152 [2019-09-08 04:38:35,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:38:36,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172152 states. [2019-09-08 04:38:56,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172152 to 167505. [2019-09-08 04:38:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167505 states. [2019-09-08 04:38:58,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167505 states to 167505 states and 308384 transitions. [2019-09-08 04:38:58,575 INFO L78 Accepts]: Start accepts. Automaton has 167505 states and 308384 transitions. Word has length 262 [2019-09-08 04:38:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:38:58,575 INFO L475 AbstractCegarLoop]: Abstraction has 167505 states and 308384 transitions. [2019-09-08 04:38:58,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:38:58,576 INFO L276 IsEmpty]: Start isEmpty. Operand 167505 states and 308384 transitions. [2019-09-08 04:38:59,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 04:38:59,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:38:59,088 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:38:59,089 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:38:59,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:38:59,089 INFO L82 PathProgramCache]: Analyzing trace with hash -676794136, now seen corresponding path program 1 times [2019-09-08 04:38:59,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:38:59,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:38:59,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:38:59,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:38:59,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:38:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:38:59,343 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:38:59,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:38:59,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 04:38:59,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 04:38:59,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 04:38:59,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:38:59,345 INFO L87 Difference]: Start difference. First operand 167505 states and 308384 transitions. Second operand 16 states. [2019-09-08 04:39:15,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:15,888 INFO L93 Difference]: Finished difference Result 217098 states and 376635 transitions. [2019-09-08 04:39:15,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 04:39:15,889 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 245 [2019-09-08 04:39:15,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:17,409 INFO L225 Difference]: With dead ends: 217098 [2019-09-08 04:39:17,409 INFO L226 Difference]: Without dead ends: 173421 [2019-09-08 04:39:17,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=1784, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 04:39:17,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173421 states. [2019-09-08 04:39:31,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173421 to 164605. [2019-09-08 04:39:31,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164605 states. [2019-09-08 04:39:31,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164605 states to 164605 states and 307906 transitions. [2019-09-08 04:39:31,983 INFO L78 Accepts]: Start accepts. Automaton has 164605 states and 307906 transitions. Word has length 245 [2019-09-08 04:39:31,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:31,984 INFO L475 AbstractCegarLoop]: Abstraction has 164605 states and 307906 transitions. [2019-09-08 04:39:31,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 04:39:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 164605 states and 307906 transitions. [2019-09-08 04:39:33,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-08 04:39:33,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:33,646 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:33,646 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:33,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:33,647 INFO L82 PathProgramCache]: Analyzing trace with hash 825619869, now seen corresponding path program 1 times [2019-09-08 04:39:33,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:33,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:33,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:33,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:33,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:33,820 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 04:39:33,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:33,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:39:33,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:39:33,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:39:33,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:39:33,822 INFO L87 Difference]: Start difference. First operand 164605 states and 307906 transitions. Second operand 9 states. [2019-09-08 04:39:45,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:45,618 INFO L93 Difference]: Finished difference Result 224226 states and 386943 transitions. [2019-09-08 04:39:45,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:39:45,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 261 [2019-09-08 04:39:45,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:46,302 INFO L225 Difference]: With dead ends: 224226 [2019-09-08 04:39:46,302 INFO L226 Difference]: Without dead ends: 172992 [2019-09-08 04:39:46,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:39:46,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172992 states. [2019-09-08 04:39:57,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172992 to 170275. [2019-09-08 04:39:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170275 states. [2019-09-08 04:39:58,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170275 states to 170275 states and 317439 transitions. [2019-09-08 04:39:58,244 INFO L78 Accepts]: Start accepts. Automaton has 170275 states and 317439 transitions. Word has length 261 [2019-09-08 04:39:58,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:58,245 INFO L475 AbstractCegarLoop]: Abstraction has 170275 states and 317439 transitions. [2019-09-08 04:39:58,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:39:58,245 INFO L276 IsEmpty]: Start isEmpty. Operand 170275 states and 317439 transitions. [2019-09-08 04:39:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 04:39:58,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:58,802 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:58,802 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:58,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:58,803 INFO L82 PathProgramCache]: Analyzing trace with hash -40417804, now seen corresponding path program 1 times [2019-09-08 04:39:58,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:58,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:58,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:58,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:58,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:58,970 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 04:39:58,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:58,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:39:58,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:39:58,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:39:58,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:39:58,974 INFO L87 Difference]: Start difference. First operand 170275 states and 317439 transitions. Second operand 9 states. [2019-09-08 04:40:12,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:12,593 INFO L93 Difference]: Finished difference Result 234530 states and 404709 transitions. [2019-09-08 04:40:12,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:40:12,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 262 [2019-09-08 04:40:12,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:13,316 INFO L225 Difference]: With dead ends: 234530 [2019-09-08 04:40:13,316 INFO L226 Difference]: Without dead ends: 178281 [2019-09-08 04:40:13,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:40:13,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178281 states. [2019-09-08 04:40:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178281 to 176875. [2019-09-08 04:40:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176875 states. [2019-09-08 04:40:24,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176875 states to 176875 states and 328194 transitions. [2019-09-08 04:40:24,446 INFO L78 Accepts]: Start accepts. Automaton has 176875 states and 328194 transitions. Word has length 262 [2019-09-08 04:40:24,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:24,447 INFO L475 AbstractCegarLoop]: Abstraction has 176875 states and 328194 transitions. [2019-09-08 04:40:24,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:40:24,447 INFO L276 IsEmpty]: Start isEmpty. Operand 176875 states and 328194 transitions. [2019-09-08 04:40:25,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-08 04:40:25,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:25,018 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:40:25,019 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:25,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:25,019 INFO L82 PathProgramCache]: Analyzing trace with hash -840515947, now seen corresponding path program 1 times [2019-09-08 04:40:25,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:25,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:25,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:25,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:25,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 04:40:25,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:25,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:40:25,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:40:25,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:40:25,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:40:25,179 INFO L87 Difference]: Start difference. First operand 176875 states and 328194 transitions. Second operand 6 states. [2019-09-08 04:40:42,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:42,293 INFO L93 Difference]: Finished difference Result 353921 states and 657697 transitions. [2019-09-08 04:40:42,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:40:42,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 263 [2019-09-08 04:40:42,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:43,002 INFO L225 Difference]: With dead ends: 353921 [2019-09-08 04:40:43,002 INFO L226 Difference]: Without dead ends: 177135 [2019-09-08 04:40:43,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:40:43,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177135 states. [2019-09-08 04:40:53,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177135 to 176998. [2019-09-08 04:40:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176998 states. [2019-09-08 04:40:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176998 states to 176998 states and 328263 transitions. [2019-09-08 04:40:54,563 INFO L78 Accepts]: Start accepts. Automaton has 176998 states and 328263 transitions. Word has length 263 [2019-09-08 04:40:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:54,564 INFO L475 AbstractCegarLoop]: Abstraction has 176998 states and 328263 transitions. [2019-09-08 04:40:54,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:40:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand 176998 states and 328263 transitions. [2019-09-08 04:40:55,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 04:40:55,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:55,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:40:55,150 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:55,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:55,150 INFO L82 PathProgramCache]: Analyzing trace with hash -107424557, now seen corresponding path program 1 times [2019-09-08 04:40:55,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:55,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:55,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:55,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:55,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 04:40:55,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:55,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:40:55,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:40:55,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:40:55,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:40:55,306 INFO L87 Difference]: Start difference. First operand 176998 states and 328263 transitions. Second operand 6 states. [2019-09-08 04:41:04,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:41:04,493 INFO L93 Difference]: Finished difference Result 282209 states and 509369 transitions. [2019-09-08 04:41:04,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:41:04,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 262 [2019-09-08 04:41:04,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:41:05,620 INFO L225 Difference]: With dead ends: 282209 [2019-09-08 04:41:05,621 INFO L226 Difference]: Without dead ends: 177238 [2019-09-08 04:41:05,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:41:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177238 states. [2019-09-08 04:41:21,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177238 to 177238. [2019-09-08 04:41:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177238 states. [2019-09-08 04:41:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177238 states to 177238 states and 324207 transitions. [2019-09-08 04:41:22,187 INFO L78 Accepts]: Start accepts. Automaton has 177238 states and 324207 transitions. Word has length 262 [2019-09-08 04:41:22,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:41:22,188 INFO L475 AbstractCegarLoop]: Abstraction has 177238 states and 324207 transitions. [2019-09-08 04:41:22,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:41:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand 177238 states and 324207 transitions. [2019-09-08 04:41:22,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 04:41:22,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:41:22,734 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:41:22,734 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:41:22,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:41:22,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1888372477, now seen corresponding path program 1 times [2019-09-08 04:41:22,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:41:22,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:41:22,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:41:22,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:41:22,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:41:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:41:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-08 04:41:22,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:41:22,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:41:22,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:41:22,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:41:22,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:41:22,896 INFO L87 Difference]: Start difference. First operand 177238 states and 324207 transitions. Second operand 6 states. [2019-09-08 04:41:32,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:41:32,688 INFO L93 Difference]: Finished difference Result 282449 states and 512723 transitions. [2019-09-08 04:41:32,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:41:32,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 267 [2019-09-08 04:41:32,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:41:33,274 INFO L225 Difference]: With dead ends: 282449 [2019-09-08 04:41:33,275 INFO L226 Difference]: Without dead ends: 177238 [2019-09-08 04:41:33,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:41:33,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177238 states. [2019-09-08 04:41:42,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177238 to 177238. [2019-09-08 04:41:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177238 states. [2019-09-08 04:41:43,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177238 states to 177238 states and 311055 transitions. [2019-09-08 04:41:43,279 INFO L78 Accepts]: Start accepts. Automaton has 177238 states and 311055 transitions. Word has length 267 [2019-09-08 04:41:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:41:43,280 INFO L475 AbstractCegarLoop]: Abstraction has 177238 states and 311055 transitions. [2019-09-08 04:41:43,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:41:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 177238 states and 311055 transitions. [2019-09-08 04:41:43,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-08 04:41:43,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:41:43,787 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:41:43,787 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:41:43,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:41:43,788 INFO L82 PathProgramCache]: Analyzing trace with hash 473294839, now seen corresponding path program 1 times [2019-09-08 04:41:43,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:41:43,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:41:43,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:41:43,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:41:43,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:41:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:41:43,938 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:41:43,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:41:43,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:41:43,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:41:43,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:41:43,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:41:43,940 INFO L87 Difference]: Start difference. First operand 177238 states and 311055 transitions. Second operand 6 states. [2019-09-08 04:42:02,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:42:02,127 INFO L93 Difference]: Finished difference Result 394843 states and 676558 transitions. [2019-09-08 04:42:02,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:42:02,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-09-08 04:42:02,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:42:04,339 INFO L225 Difference]: With dead ends: 394843 [2019-09-08 04:42:04,340 INFO L226 Difference]: Without dead ends: 354887 [2019-09-08 04:42:04,512 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 04:42:04,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354887 states.