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_spec9_product21.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:10:12,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:10:12,388 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:10:12,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:10:12,401 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:10:12,402 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:10:12,404 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:10:12,406 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:10:12,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:10:12,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:10:12,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:10:12,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:10:12,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:10:12,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:10:12,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:10:12,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:10:12,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:10:12,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:10:12,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:10:12,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:10:12,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:10:12,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:10:12,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:10:12,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:10:12,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:10:12,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:10:12,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:10:12,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:10:12,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:10:12,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:10:12,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:10:12,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:10:12,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:10:12,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:10:12,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:10:12,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:10:12,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:10:12,434 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:10:12,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:10:12,435 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:10:12,435 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:10:12,436 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-10-02 14:10:12,451 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:10:12,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:10:12,453 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:10:12,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:10:12,453 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:10:12,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:10:12,454 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:10:12,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:10:12,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:10:12,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:10:12,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:10:12,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:10:12,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:10:12,455 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:10:12,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:10:12,456 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:10:12,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:10:12,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:10:12,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:10:12,456 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:10:12,457 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:10:12,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:10:12,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:10:12,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:10:12,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:10:12,458 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:10:12,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:10:12,458 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:10:12,458 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:10:12,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:10:12,505 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:10:12,511 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:10:12,513 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:10:12,513 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:10:12,514 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec9_product21.cil.c [2019-10-02 14:10:12,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5996930/62b5c22245fb48dd8981b08740795cd8/FLAG78a6ed550 [2019-10-02 14:10:13,332 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:10:13,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec9_product21.cil.c [2019-10-02 14:10:13,356 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5996930/62b5c22245fb48dd8981b08740795cd8/FLAG78a6ed550 [2019-10-02 14:10:13,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5996930/62b5c22245fb48dd8981b08740795cd8 [2019-10-02 14:10:13,563 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:10:13,565 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:10:13,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:10:13,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:10:13,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:10:13,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:10:13" (1/1) ... [2019-10-02 14:10:13,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66cd572e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:10:13, skipping insertion in model container [2019-10-02 14:10:13,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:10:13" (1/1) ... [2019-10-02 14:10:13,584 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:10:13,673 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:10:14,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:10:14,640 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:10:14,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:10:14,890 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:10:14,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:10:14 WrapperNode [2019-10-02 14:10:14,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:10:14,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:10:14,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:10:14,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:10:14,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:10:14" (1/1) ... [2019-10-02 14:10:14,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:10:14" (1/1) ... [2019-10-02 14:10:14,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:10:14" (1/1) ... [2019-10-02 14:10:14,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:10:14" (1/1) ... [2019-10-02 14:10:15,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:10:14" (1/1) ... [2019-10-02 14:10:15,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:10:14" (1/1) ... [2019-10-02 14:10:15,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:10:14" (1/1) ... [2019-10-02 14:10:15,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:10:15,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:10:15,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:10:15,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:10:15,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:10:14" (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-10-02 14:10:15,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:10:15,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:10:15,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 14:10:15,155 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 14:10:15,156 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 14:10:15,156 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-02 14:10:15,157 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 14:10:15,157 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 14:10:15,157 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-02 14:10:15,157 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 14:10:15,157 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 14:10:15,158 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 14:10:15,158 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 14:10:15,159 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 14:10:15,159 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 14:10:15,160 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 14:10:15,162 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 14:10:15,162 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 14:10:15,162 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 14:10:15,163 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 14:10:15,163 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 14:10:15,163 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 14:10:15,163 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 14:10:15,163 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 14:10:15,164 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 14:10:15,164 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 14:10:15,164 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 14:10:15,164 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 14:10:15,164 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 14:10:15,164 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 14:10:15,165 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 14:10:15,165 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 14:10:15,165 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 14:10:15,165 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 14:10:15,165 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 14:10:15,165 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 14:10:15,166 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 14:10:15,166 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 14:10:15,166 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 14:10:15,166 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 14:10:15,166 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 14:10:15,167 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 14:10:15,167 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 14:10:15,167 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 14:10:15,167 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 14:10:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 14:10:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 14:10:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 14:10:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 14:10:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 14:10:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 14:10:15,169 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 14:10:15,169 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 14:10:15,169 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 14:10:15,169 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 14:10:15,169 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 14:10:15,169 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 14:10:15,170 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 14:10:15,170 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 14:10:15,170 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 14:10:15,171 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 14:10:15,171 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 14:10:15,171 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 14:10:15,171 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 14:10:15,171 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 14:10:15,171 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 14:10:15,172 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 14:10:15,172 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 14:10:15,172 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 14:10:15,172 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 14:10:15,173 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 14:10:15,173 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 14:10:15,173 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 14:10:15,173 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 14:10:15,174 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 14:10:15,174 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 14:10:15,174 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 14:10:15,175 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 14:10:15,175 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 14:10:15,175 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 14:10:15,175 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 14:10:15,175 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 14:10:15,176 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 14:10:15,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__1 [2019-10-02 14:10:15,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__2 [2019-10-02 14:10:15,176 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 14:10:15,176 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 14:10:15,177 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 14:10:15,177 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 14:10:15,177 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 14:10:15,178 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 14:10:15,178 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 14:10:15,178 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 14:10:15,178 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 14:10:15,179 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 14:10:15,179 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:10:15,179 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 14:10:15,179 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 14:10:15,179 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 14:10:15,179 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 14:10:15,179 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 14:10:15,180 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 14:10:15,180 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 14:10:15,180 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 14:10:15,180 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 14:10:15,180 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 14:10:15,180 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 14:10:15,180 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 14:10:15,181 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 14:10:15,181 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 14:10:15,181 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 14:10:15,181 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 14:10:15,181 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 14:10:15,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:10:15,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:10:15,182 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 14:10:15,182 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 14:10:15,182 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 14:10:15,182 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 14:10:15,182 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 14:10:15,183 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 14:10:15,183 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 14:10:15,183 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 14:10:15,183 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 14:10:15,185 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 14:10:15,185 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 14:10:15,185 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 14:10:15,185 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 14:10:15,185 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 14:10:15,185 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 14:10:15,185 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 14:10:15,186 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 14:10:15,186 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 14:10:15,186 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 14:10:15,186 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 14:10:15,187 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 14:10:15,187 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 14:10:15,187 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 14:10:15,187 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 14:10:15,188 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 14:10:15,191 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 14:10:15,192 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 14:10:15,192 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 14:10:15,192 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 14:10:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 14:10:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 14:10:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 14:10:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 14:10:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__2 [2019-10-02 14:10:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 14:10:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 14:10:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-02 14:10:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-02 14:10:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 14:10:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__1 [2019-10-02 14:10:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 14:10:15,203 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 14:10:15,203 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 14:10:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 14:10:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 14:10:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 14:10:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 14:10:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 14:10:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 14:10:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 14:10:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 14:10:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 14:10:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 14:10:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 14:10:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 14:10:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 14:10:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 14:10:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 14:10:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 14:10:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 14:10:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 14:10:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 14:10:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 14:10:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 14:10:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 14:10:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 14:10:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 14:10:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 14:10:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 14:10:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 14:10:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 14:10:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 14:10:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 14:10:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 14:10:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 14:10:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 14:10:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 14:10:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 14:10:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 14:10:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 14:10:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 14:10:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 14:10:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 14:10:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 14:10:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 14:10:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 14:10:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 14:10:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 14:10:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 14:10:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 14:10:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 14:10:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 14:10:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 14:10:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 14:10:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 14:10:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 14:10:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 14:10:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 14:10:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 14:10:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 14:10:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 14:10:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:10:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 14:10:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 14:10:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 14:10:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 14:10:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 14:10:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 14:10:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 14:10:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 14:10:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 14:10:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 14:10:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 14:10:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 14:10:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 14:10:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 14:10:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 14:10:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 14:10:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 14:10:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 14:10:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 14:10:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 14:10:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 14:10:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:10:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 14:10:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:10:17,823 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:10:17,823 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 14:10:17,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:10:17 BoogieIcfgContainer [2019-10-02 14:10:17,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:10:17,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:10:17,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:10:17,831 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:10:17,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:10:13" (1/3) ... [2019-10-02 14:10:17,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bd35d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:10:17, skipping insertion in model container [2019-10-02 14:10:17,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:10:14" (2/3) ... [2019-10-02 14:10:17,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bd35d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:10:17, skipping insertion in model container [2019-10-02 14:10:17,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:10:17" (3/3) ... [2019-10-02 14:10:17,836 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec9_product21.cil.c [2019-10-02 14:10:17,848 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:10:17,861 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:10:17,880 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:10:17,920 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:10:17,920 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:10:17,921 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:10:17,921 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:10:17,921 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:10:17,921 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:10:17,921 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:10:17,921 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:10:17,921 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:10:17,957 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states. [2019-10-02 14:10:17,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 14:10:17,981 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:10:17,985 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:10:17,989 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:10:17,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:10:18,000 INFO L82 PathProgramCache]: Analyzing trace with hash 453120643, now seen corresponding path program 1 times [2019-10-02 14:10:18,002 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:10:18,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:10:18,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:18,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:10:18,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:10:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:10:18,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:10:18,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 14:10:18,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 14:10:18,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 14:10:18,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:10:18,776 INFO L87 Difference]: Start difference. First operand 573 states. Second operand 2 states. [2019-10-02 14:10:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:10:18,998 INFO L93 Difference]: Finished difference Result 832 states and 1126 transitions. [2019-10-02 14:10:18,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 14:10:19,000 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 154 [2019-10-02 14:10:19,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:10:19,038 INFO L225 Difference]: With dead ends: 832 [2019-10-02 14:10:19,038 INFO L226 Difference]: Without dead ends: 544 [2019-10-02 14:10:19,051 INFO L640 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-10-02 14:10:19,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-10-02 14:10:19,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2019-10-02 14:10:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-02 14:10:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 742 transitions. [2019-10-02 14:10:19,159 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 742 transitions. Word has length 154 [2019-10-02 14:10:19,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:10:19,162 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 742 transitions. [2019-10-02 14:10:19,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 14:10:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 742 transitions. [2019-10-02 14:10:19,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 14:10:19,168 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:10:19,168 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:10:19,169 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:10:19,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:10:19,169 INFO L82 PathProgramCache]: Analyzing trace with hash 545011492, now seen corresponding path program 1 times [2019-10-02 14:10:19,169 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:10:19,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:10:19,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:19,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:10:19,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:10:19,498 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:10:19,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:10:19,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:10:19,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:10:19,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:10:19,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:10:19,510 INFO L87 Difference]: Start difference. First operand 544 states and 742 transitions. Second operand 3 states. [2019-10-02 14:10:19,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:10:19,594 INFO L93 Difference]: Finished difference Result 815 states and 1092 transitions. [2019-10-02 14:10:19,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:10:19,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-02 14:10:19,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:10:19,606 INFO L225 Difference]: With dead ends: 815 [2019-10-02 14:10:19,606 INFO L226 Difference]: Without dead ends: 547 [2019-10-02 14:10:19,619 INFO L640 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-10-02 14:10:19,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-10-02 14:10:19,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 546. [2019-10-02 14:10:19,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-10-02 14:10:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 744 transitions. [2019-10-02 14:10:19,665 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 744 transitions. Word has length 155 [2019-10-02 14:10:19,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:10:19,666 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 744 transitions. [2019-10-02 14:10:19,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:10:19,666 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 744 transitions. [2019-10-02 14:10:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 14:10:19,670 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:10:19,670 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:10:19,671 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:10:19,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:10:19,671 INFO L82 PathProgramCache]: Analyzing trace with hash -35318856, now seen corresponding path program 1 times [2019-10-02 14:10:19,671 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:10:19,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:10:19,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:19,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:10:19,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:10:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:10:19,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:10:19,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:10:19,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:10:19,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:10:19,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:10:19,841 INFO L87 Difference]: Start difference. First operand 546 states and 744 transitions. Second operand 3 states. [2019-10-02 14:10:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:10:19,897 INFO L93 Difference]: Finished difference Result 1070 states and 1489 transitions. [2019-10-02 14:10:19,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:10:19,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-02 14:10:19,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:10:19,907 INFO L225 Difference]: With dead ends: 1070 [2019-10-02 14:10:19,907 INFO L226 Difference]: Without dead ends: 589 [2019-10-02 14:10:19,909 INFO L640 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-10-02 14:10:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-02 14:10:20,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 588. [2019-10-02 14:10:20,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-02 14:10:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 816 transitions. [2019-10-02 14:10:20,018 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 816 transitions. Word has length 161 [2019-10-02 14:10:20,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:10:20,020 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 816 transitions. [2019-10-02 14:10:20,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:10:20,020 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2019-10-02 14:10:20,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 14:10:20,030 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:10:20,030 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:10:20,030 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:10:20,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:10:20,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1484385575, now seen corresponding path program 1 times [2019-10-02 14:10:20,031 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:10:20,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:10:20,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:20,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:10:20,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:10:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 14:10:20,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:10:20,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:10:20,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:10:20,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:10:20,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:10:20,363 INFO L87 Difference]: Start difference. First operand 588 states and 816 transitions. Second operand 3 states. [2019-10-02 14:10:20,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:10:20,418 INFO L93 Difference]: Finished difference Result 957 states and 1317 transitions. [2019-10-02 14:10:20,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:10:20,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-10-02 14:10:20,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:10:20,428 INFO L225 Difference]: With dead ends: 957 [2019-10-02 14:10:20,428 INFO L226 Difference]: Without dead ends: 702 [2019-10-02 14:10:20,430 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:10:20,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-10-02 14:10:20,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 701. [2019-10-02 14:10:20,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-10-02 14:10:20,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 978 transitions. [2019-10-02 14:10:20,478 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 978 transitions. Word has length 162 [2019-10-02 14:10:20,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:10:20,479 INFO L475 AbstractCegarLoop]: Abstraction has 701 states and 978 transitions. [2019-10-02 14:10:20,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:10:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 978 transitions. [2019-10-02 14:10:20,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-02 14:10:20,489 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:10:20,489 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-02 14:10:20,490 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:10:20,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:10:20,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1253289974, now seen corresponding path program 1 times [2019-10-02 14:10:20,490 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:10:20,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:10:20,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:20,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:10:20,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:10:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 14:10:20,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:10:20,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:10:20,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:10:20,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:10:20,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:10:20,891 INFO L87 Difference]: Start difference. First operand 701 states and 978 transitions. Second operand 6 states. [2019-10-02 14:10:21,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:10:21,626 INFO L93 Difference]: Finished difference Result 1710 states and 2381 transitions. [2019-10-02 14:10:21,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:10:21,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 286 [2019-10-02 14:10:21,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:10:21,636 INFO L225 Difference]: With dead ends: 1710 [2019-10-02 14:10:21,636 INFO L226 Difference]: Without dead ends: 1353 [2019-10-02 14:10:21,638 INFO L640 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-10-02 14:10:21,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2019-10-02 14:10:21,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1342. [2019-10-02 14:10:21,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-10-02 14:10:21,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1892 transitions. [2019-10-02 14:10:21,718 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1892 transitions. Word has length 286 [2019-10-02 14:10:21,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:10:21,720 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 1892 transitions. [2019-10-02 14:10:21,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:10:21,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1892 transitions. [2019-10-02 14:10:21,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-10-02 14:10:21,729 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:10:21,730 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-02 14:10:21,730 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:10:21,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:10:21,731 INFO L82 PathProgramCache]: Analyzing trace with hash 932243253, now seen corresponding path program 1 times [2019-10-02 14:10:21,731 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:10:21,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:10:21,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:21,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:10:21,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:10:22,076 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 14:10:22,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:10:22,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:10:22,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:10:22,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:10:22,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:10:22,078 INFO L87 Difference]: Start difference. First operand 1342 states and 1892 transitions. Second operand 9 states. [2019-10-02 14:10:22,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:10:22,489 INFO L93 Difference]: Finished difference Result 2053 states and 2833 transitions. [2019-10-02 14:10:22,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:10:22,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 287 [2019-10-02 14:10:22,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:10:22,502 INFO L225 Difference]: With dead ends: 2053 [2019-10-02 14:10:22,503 INFO L226 Difference]: Without dead ends: 1316 [2019-10-02 14:10:22,511 INFO L640 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-10-02 14:10:22,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2019-10-02 14:10:22,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1312. [2019-10-02 14:10:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2019-10-02 14:10:22,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1841 transitions. [2019-10-02 14:10:22,612 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1841 transitions. Word has length 287 [2019-10-02 14:10:22,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:10:22,613 INFO L475 AbstractCegarLoop]: Abstraction has 1312 states and 1841 transitions. [2019-10-02 14:10:22,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:10:22,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1841 transitions. [2019-10-02 14:10:22,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-02 14:10:22,628 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:10:22,628 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-02 14:10:22,629 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:10:22,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:10:22,629 INFO L82 PathProgramCache]: Analyzing trace with hash 2088054668, now seen corresponding path program 1 times [2019-10-02 14:10:22,630 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:10:22,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:10:22,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:22,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:10:22,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:10:23,315 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 14:10:23,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:10:23,316 INFO L224 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-10-02 14:10:23,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:10:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:10:24,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 3291 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:10:24,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:10:24,440 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:10:24,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:10:24,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2019-10-02 14:10:24,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:10:24,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:10:24,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:10:24,466 INFO L87 Difference]: Start difference. First operand 1312 states and 1841 transitions. Second operand 29 states. [2019-10-02 14:11:07,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:07,724 INFO L93 Difference]: Finished difference Result 8588 states and 12549 transitions. [2019-10-02 14:11:07,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-10-02 14:11:07,725 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 280 [2019-10-02 14:11:07,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:07,772 INFO L225 Difference]: With dead ends: 8588 [2019-10-02 14:11:07,772 INFO L226 Difference]: Without dead ends: 7136 [2019-10-02 14:11:07,789 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10483 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2054, Invalid=28048, Unknown=0, NotChecked=0, Total=30102 [2019-10-02 14:11:07,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7136 states. [2019-10-02 14:11:08,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7136 to 6738. [2019-10-02 14:11:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6738 states. [2019-10-02 14:11:08,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6738 states to 6738 states and 9656 transitions. [2019-10-02 14:11:08,189 INFO L78 Accepts]: Start accepts. Automaton has 6738 states and 9656 transitions. Word has length 280 [2019-10-02 14:11:08,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:08,190 INFO L475 AbstractCegarLoop]: Abstraction has 6738 states and 9656 transitions. [2019-10-02 14:11:08,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:11:08,190 INFO L276 IsEmpty]: Start isEmpty. Operand 6738 states and 9656 transitions. [2019-10-02 14:11:08,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-10-02 14:11:08,213 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:08,215 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-02 14:11:08,215 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:08,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:08,215 INFO L82 PathProgramCache]: Analyzing trace with hash -930646727, now seen corresponding path program 1 times [2019-10-02 14:11:08,216 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:08,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:08,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:08,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:08,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:08,689 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 14:11:08,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:11:08,689 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:11:08,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:09,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 3293 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:11:09,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:11:09,875 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 14:11:09,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:11:09,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2019-10-02 14:11:09,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:11:09,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:11:09,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:11:09,896 INFO L87 Difference]: Start difference. First operand 6738 states and 9656 transitions. Second operand 23 states. [2019-10-02 14:11:46,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:46,551 INFO L93 Difference]: Finished difference Result 20284 states and 29751 transitions. [2019-10-02 14:11:46,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-10-02 14:11:46,552 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 282 [2019-10-02 14:11:46,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:46,633 INFO L225 Difference]: With dead ends: 20284 [2019-10-02 14:11:46,633 INFO L226 Difference]: Without dead ends: 11658 [2019-10-02 14:11:46,678 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9603 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1916, Invalid=24816, Unknown=0, NotChecked=0, Total=26732 [2019-10-02 14:11:46,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11658 states. [2019-10-02 14:11:47,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11658 to 10128. [2019-10-02 14:11:47,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10128 states. [2019-10-02 14:11:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10128 states to 10128 states and 14581 transitions. [2019-10-02 14:11:47,326 INFO L78 Accepts]: Start accepts. Automaton has 10128 states and 14581 transitions. Word has length 282 [2019-10-02 14:11:47,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:47,327 INFO L475 AbstractCegarLoop]: Abstraction has 10128 states and 14581 transitions. [2019-10-02 14:11:47,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:11:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 10128 states and 14581 transitions. [2019-10-02 14:11:47,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-02 14:11:47,353 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:47,353 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:11:47,354 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:47,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:47,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1775291433, now seen corresponding path program 1 times [2019-10-02 14:11:47,354 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:47,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:47,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:47,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:47,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-02 14:11:47,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:11:47,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:11:47,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:11:47,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:11:47,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:11:47,568 INFO L87 Difference]: Start difference. First operand 10128 states and 14581 transitions. Second operand 5 states. [2019-10-02 14:11:47,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:47,975 INFO L93 Difference]: Finished difference Result 18649 states and 26620 transitions. [2019-10-02 14:11:47,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:11:47,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 286 [2019-10-02 14:11:47,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:48,063 INFO L225 Difference]: With dead ends: 18649 [2019-10-02 14:11:48,063 INFO L226 Difference]: Without dead ends: 9458 [2019-10-02 14:11:48,118 INFO L640 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-10-02 14:11:48,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9458 states. [2019-10-02 14:11:48,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9458 to 9326. [2019-10-02 14:11:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9326 states. [2019-10-02 14:11:48,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9326 states to 9326 states and 13356 transitions. [2019-10-02 14:11:48,834 INFO L78 Accepts]: Start accepts. Automaton has 9326 states and 13356 transitions. Word has length 286 [2019-10-02 14:11:48,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:48,835 INFO L475 AbstractCegarLoop]: Abstraction has 9326 states and 13356 transitions. [2019-10-02 14:11:48,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:11:48,835 INFO L276 IsEmpty]: Start isEmpty. Operand 9326 states and 13356 transitions. [2019-10-02 14:11:48,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-02 14:11:48,855 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:48,856 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:11:48,856 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:48,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:48,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1645489139, now seen corresponding path program 1 times [2019-10-02 14:11:48,857 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:48,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:48,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:48,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:48,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 14:11:49,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:11:49,365 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:11:49,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:50,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 3295 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:11:50,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:11:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 14:11:50,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:11:50,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-10-02 14:11:50,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 14:11:50,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 14:11:50,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:11:50,383 INFO L87 Difference]: Start difference. First operand 9326 states and 13356 transitions. Second operand 25 states. [2019-10-02 14:12:30,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:12:30,245 INFO L93 Difference]: Finished difference Result 26559 states and 38876 transitions. [2019-10-02 14:12:30,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-10-02 14:12:30,246 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 284 [2019-10-02 14:12:30,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:12:30,328 INFO L225 Difference]: With dead ends: 26559 [2019-10-02 14:12:30,328 INFO L226 Difference]: Without dead ends: 14273 [2019-10-02 14:12:30,380 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9591 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1939, Invalid=25451, Unknown=0, NotChecked=0, Total=27390 [2019-10-02 14:12:30,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14273 states. [2019-10-02 14:12:31,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14273 to 11892. [2019-10-02 14:12:31,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11892 states. [2019-10-02 14:12:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11892 states to 11892 states and 17042 transitions. [2019-10-02 14:12:31,198 INFO L78 Accepts]: Start accepts. Automaton has 11892 states and 17042 transitions. Word has length 284 [2019-10-02 14:12:31,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:12:31,198 INFO L475 AbstractCegarLoop]: Abstraction has 11892 states and 17042 transitions. [2019-10-02 14:12:31,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 14:12:31,198 INFO L276 IsEmpty]: Start isEmpty. Operand 11892 states and 17042 transitions. [2019-10-02 14:12:31,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-02 14:12:31,219 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:12:31,220 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:12:31,220 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:12:31,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:12:31,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1675054282, now seen corresponding path program 1 times [2019-10-02 14:12:31,220 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:12:31,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:12:31,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:31,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:12:31,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:12:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-02 14:12:31,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:12:31,547 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:12:31,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:12:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:12:32,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 3295 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:12:32,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:12:32,387 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 14:12:32,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:12:32,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2019-10-02 14:12:32,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:12:32,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:12:32,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:12:32,396 INFO L87 Difference]: Start difference. First operand 11892 states and 17042 transitions. Second operand 23 states. [2019-10-02 14:12:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:12:35,441 INFO L93 Difference]: Finished difference Result 24930 states and 37066 transitions. [2019-10-02 14:12:35,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 14:12:35,442 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 284 [2019-10-02 14:12:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:12:35,667 INFO L225 Difference]: With dead ends: 24930 [2019-10-02 14:12:35,667 INFO L226 Difference]: Without dead ends: 12719 [2019-10-02 14:12:35,691 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=1740, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 14:12:35,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12719 states. [2019-10-02 14:12:36,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12719 to 12658. [2019-10-02 14:12:36,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12658 states. [2019-10-02 14:12:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12658 states to 12658 states and 18297 transitions. [2019-10-02 14:12:36,364 INFO L78 Accepts]: Start accepts. Automaton has 12658 states and 18297 transitions. Word has length 284 [2019-10-02 14:12:36,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:12:36,364 INFO L475 AbstractCegarLoop]: Abstraction has 12658 states and 18297 transitions. [2019-10-02 14:12:36,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:12:36,365 INFO L276 IsEmpty]: Start isEmpty. Operand 12658 states and 18297 transitions. [2019-10-02 14:12:36,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-10-02 14:12:36,388 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:12:36,390 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:12:36,390 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:12:36,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:12:36,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1487312318, now seen corresponding path program 1 times [2019-10-02 14:12:36,390 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:12:36,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:12:36,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:36,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:12:36,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:12:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 14:12:36,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:12:36,867 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:12:37,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:12:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:12:37,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 3296 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:12:37,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:12:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 14:12:37,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:12:37,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [24] total 29 [2019-10-02 14:12:37,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:12:37,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:12:37,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=748, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:12:37,822 INFO L87 Difference]: Start difference. First operand 12658 states and 18297 transitions. Second operand 29 states. [2019-10-02 14:13:19,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:19,491 INFO L93 Difference]: Finished difference Result 50034 states and 75131 transitions. [2019-10-02 14:13:19,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2019-10-02 14:13:19,492 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 287 [2019-10-02 14:13:19,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:19,616 INFO L225 Difference]: With dead ends: 50034 [2019-10-02 14:13:19,617 INFO L226 Difference]: Without dead ends: 32279 [2019-10-02 14:13:19,684 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15388 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2506, Invalid=39314, Unknown=0, NotChecked=0, Total=41820 [2019-10-02 14:13:19,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32279 states. [2019-10-02 14:13:21,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32279 to 28214. [2019-10-02 14:13:21,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28214 states. [2019-10-02 14:13:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28214 states to 28214 states and 41585 transitions. [2019-10-02 14:13:21,343 INFO L78 Accepts]: Start accepts. Automaton has 28214 states and 41585 transitions. Word has length 287 [2019-10-02 14:13:21,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:21,344 INFO L475 AbstractCegarLoop]: Abstraction has 28214 states and 41585 transitions. [2019-10-02 14:13:21,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:13:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 28214 states and 41585 transitions. [2019-10-02 14:13:21,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-10-02 14:13:21,371 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:21,371 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:13:21,371 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:21,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:21,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1118165750, now seen corresponding path program 1 times [2019-10-02 14:13:21,372 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:21,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:21,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:21,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:21,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 14:13:21,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:21,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:13:21,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:13:21,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:13:21,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:13:21,609 INFO L87 Difference]: Start difference. First operand 28214 states and 41585 transitions. Second operand 9 states. [2019-10-02 14:13:22,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:22,847 INFO L93 Difference]: Finished difference Result 54374 states and 81967 transitions. [2019-10-02 14:13:22,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:13:22,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 290 [2019-10-02 14:13:22,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:22,995 INFO L225 Difference]: With dead ends: 54374 [2019-10-02 14:13:22,996 INFO L226 Difference]: Without dead ends: 29312 [2019-10-02 14:13:23,082 INFO L640 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-10-02 14:13:23,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29312 states. [2019-10-02 14:13:24,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29312 to 29049. [2019-10-02 14:13:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29049 states. [2019-10-02 14:13:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29049 states to 29049 states and 42942 transitions. [2019-10-02 14:13:24,491 INFO L78 Accepts]: Start accepts. Automaton has 29049 states and 42942 transitions. Word has length 290 [2019-10-02 14:13:24,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:24,492 INFO L475 AbstractCegarLoop]: Abstraction has 29049 states and 42942 transitions. [2019-10-02 14:13:24,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:13:24,492 INFO L276 IsEmpty]: Start isEmpty. Operand 29049 states and 42942 transitions. [2019-10-02 14:13:24,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-02 14:13:24,521 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:24,524 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:13:24,525 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:24,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:24,525 INFO L82 PathProgramCache]: Analyzing trace with hash 431351939, now seen corresponding path program 1 times [2019-10-02 14:13:24,525 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:24,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:24,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:24,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:24,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 14:13:24,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:13:24,735 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:13:24,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:26,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 3297 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:13:26,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:13:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 14:13:27,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:13:27,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-10-02 14:13:27,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:13:27,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:13:27,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:13:27,101 INFO L87 Difference]: Start difference. First operand 29049 states and 42942 transitions. Second operand 10 states. [2019-10-02 14:13:32,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:32,168 INFO L93 Difference]: Finished difference Result 89542 states and 132859 transitions. [2019-10-02 14:13:32,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 14:13:32,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 286 [2019-10-02 14:13:32,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:32,720 INFO L225 Difference]: With dead ends: 89542 [2019-10-02 14:13:32,720 INFO L226 Difference]: Without dead ends: 60311 [2019-10-02 14:13:32,819 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-10-02 14:13:32,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60311 states. [2019-10-02 14:13:34,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60311 to 59685. [2019-10-02 14:13:34,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59685 states. [2019-10-02 14:13:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59685 states to 59685 states and 88340 transitions. [2019-10-02 14:13:37,656 INFO L78 Accepts]: Start accepts. Automaton has 59685 states and 88340 transitions. Word has length 286 [2019-10-02 14:13:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:37,657 INFO L475 AbstractCegarLoop]: Abstraction has 59685 states and 88340 transitions. [2019-10-02 14:13:37,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:13:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 59685 states and 88340 transitions. [2019-10-02 14:13:37,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-02 14:13:37,676 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:37,676 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:13:37,676 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:37,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:37,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1506193257, now seen corresponding path program 1 times [2019-10-02 14:13:37,677 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:37,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:37,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:37,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:37,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:37,871 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 14:13:37,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:37,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:13:37,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:13:37,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:13:37,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:13:37,873 INFO L87 Difference]: Start difference. First operand 59685 states and 88340 transitions. Second operand 9 states. [2019-10-02 14:13:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:38,966 INFO L93 Difference]: Finished difference Result 91320 states and 136713 transitions. [2019-10-02 14:13:38,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:13:38,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 288 [2019-10-02 14:13:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:39,133 INFO L225 Difference]: With dead ends: 91320 [2019-10-02 14:13:39,133 INFO L226 Difference]: Without dead ends: 35431 [2019-10-02 14:13:39,302 INFO L640 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-10-02 14:13:39,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35431 states. [2019-10-02 14:13:41,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35431 to 35303. [2019-10-02 14:13:41,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35303 states. [2019-10-02 14:13:41,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35303 states to 35303 states and 51537 transitions. [2019-10-02 14:13:41,326 INFO L78 Accepts]: Start accepts. Automaton has 35303 states and 51537 transitions. Word has length 288 [2019-10-02 14:13:41,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:41,327 INFO L475 AbstractCegarLoop]: Abstraction has 35303 states and 51537 transitions. [2019-10-02 14:13:41,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:13:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 35303 states and 51537 transitions. [2019-10-02 14:13:41,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-10-02 14:13:41,341 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:41,342 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:13:41,342 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:41,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:41,342 INFO L82 PathProgramCache]: Analyzing trace with hash 907973277, now seen corresponding path program 1 times [2019-10-02 14:13:41,342 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:41,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:41,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:41,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:41,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:41,573 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 14:13:41,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:41,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 14:13:41,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:13:41,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:13:41,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:13:41,576 INFO L87 Difference]: Start difference. First operand 35303 states and 51537 transitions. Second operand 11 states. [2019-10-02 14:13:48,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:48,878 INFO L93 Difference]: Finished difference Result 85579 states and 125851 transitions. [2019-10-02 14:13:48,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:13:48,878 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 287 [2019-10-02 14:13:48,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:49,111 INFO L225 Difference]: With dead ends: 85579 [2019-10-02 14:13:49,112 INFO L226 Difference]: Without dead ends: 51591 [2019-10-02 14:13:49,220 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:13:49,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51591 states. [2019-10-02 14:13:50,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51591 to 49785. [2019-10-02 14:13:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49785 states. [2019-10-02 14:13:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49785 states to 49785 states and 73109 transitions. [2019-10-02 14:13:51,033 INFO L78 Accepts]: Start accepts. Automaton has 49785 states and 73109 transitions. Word has length 287 [2019-10-02 14:13:51,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:51,034 INFO L475 AbstractCegarLoop]: Abstraction has 49785 states and 73109 transitions. [2019-10-02 14:13:51,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:13:51,034 INFO L276 IsEmpty]: Start isEmpty. Operand 49785 states and 73109 transitions. [2019-10-02 14:13:51,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-10-02 14:13:51,051 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:51,051 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:51,051 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:51,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:51,052 INFO L82 PathProgramCache]: Analyzing trace with hash -598697585, now seen corresponding path program 1 times [2019-10-02 14:13:51,052 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:51,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:51,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:51,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:51,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-02 14:13:51,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:51,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:13:51,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:13:51,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:13:51,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:51,576 INFO L87 Difference]: Start difference. First operand 49785 states and 73109 transitions. Second operand 3 states. [2019-10-02 14:13:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:52,767 INFO L93 Difference]: Finished difference Result 99997 states and 147059 transitions. [2019-10-02 14:13:52,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:13:52,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-10-02 14:13:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:52,945 INFO L225 Difference]: With dead ends: 99997 [2019-10-02 14:13:52,945 INFO L226 Difference]: Without dead ends: 50301 [2019-10-02 14:13:53,041 INFO L640 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-10-02 14:13:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50301 states. [2019-10-02 14:13:54,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50301 to 50295. [2019-10-02 14:13:54,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50295 states. [2019-10-02 14:13:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50295 states to 50295 states and 74033 transitions. [2019-10-02 14:13:55,150 INFO L78 Accepts]: Start accepts. Automaton has 50295 states and 74033 transitions. Word has length 327 [2019-10-02 14:13:55,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:55,150 INFO L475 AbstractCegarLoop]: Abstraction has 50295 states and 74033 transitions. [2019-10-02 14:13:55,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:13:55,151 INFO L276 IsEmpty]: Start isEmpty. Operand 50295 states and 74033 transitions. [2019-10-02 14:13:55,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-10-02 14:13:55,171 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:55,171 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:55,172 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:55,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:55,172 INFO L82 PathProgramCache]: Analyzing trace with hash -308729827, now seen corresponding path program 1 times [2019-10-02 14:13:55,172 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:55,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:55,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:55,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:55,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 14:13:55,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:55,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:13:55,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:13:55,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:13:55,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:55,333 INFO L87 Difference]: Start difference. First operand 50295 states and 74033 transitions. Second operand 3 states. [2019-10-02 14:13:56,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:56,999 INFO L93 Difference]: Finished difference Result 101467 states and 149735 transitions. [2019-10-02 14:13:57,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:13:57,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2019-10-02 14:13:57,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:57,156 INFO L225 Difference]: With dead ends: 101467 [2019-10-02 14:13:57,156 INFO L226 Difference]: Without dead ends: 51261 [2019-10-02 14:13:57,234 INFO L640 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-10-02 14:13:57,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51261 states. [2019-10-02 14:13:58,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51261 to 51255. [2019-10-02 14:13:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51255 states. [2019-10-02 14:13:58,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51255 states to 51255 states and 75773 transitions. [2019-10-02 14:13:58,853 INFO L78 Accepts]: Start accepts. Automaton has 51255 states and 75773 transitions. Word has length 334 [2019-10-02 14:13:58,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:58,854 INFO L475 AbstractCegarLoop]: Abstraction has 51255 states and 75773 transitions. [2019-10-02 14:13:58,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:13:58,854 INFO L276 IsEmpty]: Start isEmpty. Operand 51255 states and 75773 transitions. [2019-10-02 14:13:58,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-10-02 14:13:58,881 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:58,881 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-02 14:13:58,881 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:58,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:58,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1316748062, now seen corresponding path program 1 times [2019-10-02 14:13:58,882 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:58,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:58,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:58,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:58,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:59,594 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-02 14:13:59,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:59,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:13:59,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:13:59,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:13:59,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:59,598 INFO L87 Difference]: Start difference. First operand 51255 states and 75773 transitions. Second operand 3 states. [2019-10-02 14:14:00,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:00,847 INFO L93 Difference]: Finished difference Result 104275 states and 154787 transitions. [2019-10-02 14:14:00,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:14:00,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-10-02 14:14:00,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:01,057 INFO L225 Difference]: With dead ends: 104275 [2019-10-02 14:14:01,058 INFO L226 Difference]: Without dead ends: 53109 [2019-10-02 14:14:01,170 INFO L640 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-10-02 14:14:01,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53109 states. [2019-10-02 14:14:03,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53109 to 53103. [2019-10-02 14:14:03,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53103 states. [2019-10-02 14:14:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53103 states to 53103 states and 79061 transitions. [2019-10-02 14:14:03,352 INFO L78 Accepts]: Start accepts. Automaton has 53103 states and 79061 transitions. Word has length 330 [2019-10-02 14:14:03,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:03,353 INFO L475 AbstractCegarLoop]: Abstraction has 53103 states and 79061 transitions. [2019-10-02 14:14:03,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:14:03,353 INFO L276 IsEmpty]: Start isEmpty. Operand 53103 states and 79061 transitions. [2019-10-02 14:14:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-10-02 14:14:03,387 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:03,388 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:14:03,388 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:03,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:03,389 INFO L82 PathProgramCache]: Analyzing trace with hash -724529695, now seen corresponding path program 1 times [2019-10-02 14:14:03,389 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:03,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:03,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:03,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:03,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 14:14:03,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:14:03,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:14:03,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:14:03,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:14:03,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:14:03,564 INFO L87 Difference]: Start difference. First operand 53103 states and 79061 transitions. Second operand 3 states. [2019-10-02 14:14:05,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:05,374 INFO L93 Difference]: Finished difference Result 109675 states and 164363 transitions. [2019-10-02 14:14:05,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:14:05,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2019-10-02 14:14:05,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:05,595 INFO L225 Difference]: With dead ends: 109675 [2019-10-02 14:14:05,596 INFO L226 Difference]: Without dead ends: 56661 [2019-10-02 14:14:05,686 INFO L640 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-10-02 14:14:05,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56661 states. [2019-10-02 14:14:07,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56661 to 56655. [2019-10-02 14:14:07,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56655 states. [2019-10-02 14:14:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56655 states to 56655 states and 85301 transitions. [2019-10-02 14:14:07,944 INFO L78 Accepts]: Start accepts. Automaton has 56655 states and 85301 transitions. Word has length 337 [2019-10-02 14:14:07,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:07,944 INFO L475 AbstractCegarLoop]: Abstraction has 56655 states and 85301 transitions. [2019-10-02 14:14:07,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:14:07,944 INFO L276 IsEmpty]: Start isEmpty. Operand 56655 states and 85301 transitions. [2019-10-02 14:14:07,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-10-02 14:14:07,975 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:07,975 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:14:07,975 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:07,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:07,975 INFO L82 PathProgramCache]: Analyzing trace with hash 769367616, now seen corresponding path program 1 times [2019-10-02 14:14:07,976 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:07,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:07,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:07,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:07,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-02 14:14:08,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:14:08,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:14:08,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:14:08,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:14:08,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:14:08,135 INFO L87 Difference]: Start difference. First operand 56655 states and 85301 transitions. Second operand 3 states. [2019-10-02 14:14:09,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:09,978 INFO L93 Difference]: Finished difference Result 120043 states and 182699 transitions. [2019-10-02 14:14:09,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:14:09,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-10-02 14:14:09,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:10,153 INFO L225 Difference]: With dead ends: 120043 [2019-10-02 14:14:10,153 INFO L226 Difference]: Without dead ends: 63477 [2019-10-02 14:14:10,247 INFO L640 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-10-02 14:14:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63477 states. [2019-10-02 14:14:12,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63477 to 63471. [2019-10-02 14:14:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63471 states. [2019-10-02 14:14:12,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63471 states to 63471 states and 97301 transitions. [2019-10-02 14:14:12,870 INFO L78 Accepts]: Start accepts. Automaton has 63471 states and 97301 transitions. Word has length 331 [2019-10-02 14:14:12,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:12,870 INFO L475 AbstractCegarLoop]: Abstraction has 63471 states and 97301 transitions. [2019-10-02 14:14:12,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:14:12,870 INFO L276 IsEmpty]: Start isEmpty. Operand 63471 states and 97301 transitions. [2019-10-02 14:14:12,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-10-02 14:14:12,924 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:12,924 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:14:12,924 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:12,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:12,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1128799434, now seen corresponding path program 1 times [2019-10-02 14:14:12,924 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:12,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:12,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:12,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:12,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:13,095 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-02 14:14:13,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:14:13,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:14:13,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:14:13,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:14:13,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:14:13,097 INFO L87 Difference]: Start difference. First operand 63471 states and 97301 transitions. Second operand 3 states. [2019-10-02 14:14:17,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:17,047 INFO L93 Difference]: Finished difference Result 139915 states and 217739 transitions. [2019-10-02 14:14:17,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:14:17,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2019-10-02 14:14:17,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:17,303 INFO L225 Difference]: With dead ends: 139915 [2019-10-02 14:14:17,303 INFO L226 Difference]: Without dead ends: 76533 [2019-10-02 14:14:17,428 INFO L640 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-10-02 14:14:17,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76533 states. [2019-10-02 14:14:22,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76533 to 76527. [2019-10-02 14:14:22,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76527 states. [2019-10-02 14:14:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76527 states to 76527 states and 120149 transitions. [2019-10-02 14:14:23,157 INFO L78 Accepts]: Start accepts. Automaton has 76527 states and 120149 transitions. Word has length 350 [2019-10-02 14:14:23,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:23,157 INFO L475 AbstractCegarLoop]: Abstraction has 76527 states and 120149 transitions. [2019-10-02 14:14:23,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:14:23,157 INFO L276 IsEmpty]: Start isEmpty. Operand 76527 states and 120149 transitions. [2019-10-02 14:14:23,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-10-02 14:14:23,267 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:23,267 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:14:23,267 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:23,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:23,268 INFO L82 PathProgramCache]: Analyzing trace with hash -809612543, now seen corresponding path program 1 times [2019-10-02 14:14:23,268 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:23,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:23,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:23,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:23,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:23,458 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 14:14:23,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:14:23,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 14:14:23,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:14:23,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:14:23,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:14:23,459 INFO L87 Difference]: Start difference. First operand 76527 states and 120149 transitions. Second operand 7 states. [2019-10-02 14:14:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:26,100 INFO L93 Difference]: Finished difference Result 153019 states and 241445 transitions. [2019-10-02 14:14:26,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:14:26,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 340 [2019-10-02 14:14:26,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:26,353 INFO L225 Difference]: With dead ends: 153019 [2019-10-02 14:14:26,353 INFO L226 Difference]: Without dead ends: 76581 [2019-10-02 14:14:26,493 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:14:26,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76581 states. [2019-10-02 14:14:31,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76581 to 76581. [2019-10-02 14:14:31,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76581 states. [2019-10-02 14:14:32,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76581 states to 76581 states and 120215 transitions. [2019-10-02 14:14:32,222 INFO L78 Accepts]: Start accepts. Automaton has 76581 states and 120215 transitions. Word has length 340 [2019-10-02 14:14:32,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:32,222 INFO L475 AbstractCegarLoop]: Abstraction has 76581 states and 120215 transitions. [2019-10-02 14:14:32,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:14:32,223 INFO L276 IsEmpty]: Start isEmpty. Operand 76581 states and 120215 transitions. [2019-10-02 14:14:32,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-10-02 14:14:32,330 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:32,331 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:14:32,331 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:32,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:32,331 INFO L82 PathProgramCache]: Analyzing trace with hash -2097792159, now seen corresponding path program 1 times [2019-10-02 14:14:32,331 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:32,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:32,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:32,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:32,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-02 14:14:32,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:14:32,556 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:14:32,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:33,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 3697 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:14:33,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:14:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-10-02 14:14:33,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:14:33,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-10-02 14:14:33,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:14:33,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:14:33,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:14:33,785 INFO L87 Difference]: Start difference. First operand 76581 states and 120215 transitions. Second operand 10 states. [2019-10-02 14:14:36,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:36,459 INFO L93 Difference]: Finished difference Result 125714 states and 192476 transitions. [2019-10-02 14:14:36,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:14:36,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 353 [2019-10-02 14:14:36,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:36,727 INFO L225 Difference]: With dead ends: 125714 [2019-10-02 14:14:36,727 INFO L226 Difference]: Without dead ends: 77556 [2019-10-02 14:14:36,834 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:14:36,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77556 states. [2019-10-02 14:14:40,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77556 to 77460. [2019-10-02 14:14:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77460 states. [2019-10-02 14:14:40,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77460 states to 77460 states and 120828 transitions. [2019-10-02 14:14:40,338 INFO L78 Accepts]: Start accepts. Automaton has 77460 states and 120828 transitions. Word has length 353 [2019-10-02 14:14:40,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:40,339 INFO L475 AbstractCegarLoop]: Abstraction has 77460 states and 120828 transitions. [2019-10-02 14:14:40,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:14:40,339 INFO L276 IsEmpty]: Start isEmpty. Operand 77460 states and 120828 transitions. [2019-10-02 14:14:40,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-10-02 14:14:40,524 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:40,525 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:14:40,525 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:40,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:40,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1328984872, now seen corresponding path program 1 times [2019-10-02 14:14:40,526 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:40,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:40,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:40,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:40,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-10-02 14:14:40,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:14:40,812 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:14:40,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:41,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 3704 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:14:41,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:14:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-10-02 14:14:41,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:14:41,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-10-02 14:14:41,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 14:14:41,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 14:14:41,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:14:41,632 INFO L87 Difference]: Start difference. First operand 77460 states and 120828 transitions. Second operand 13 states. [2019-10-02 14:14:46,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:46,452 INFO L93 Difference]: Finished difference Result 130139 states and 198234 transitions. [2019-10-02 14:14:46,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:14:46,452 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 359 [2019-10-02 14:14:46,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:46,664 INFO L225 Difference]: With dead ends: 130139 [2019-10-02 14:14:46,664 INFO L226 Difference]: Without dead ends: 81915 [2019-10-02 14:14:46,745 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:14:46,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81915 states. [2019-10-02 14:14:49,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81915 to 81602. [2019-10-02 14:14:49,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81602 states. [2019-10-02 14:14:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81602 states to 81602 states and 127540 transitions. [2019-10-02 14:14:49,915 INFO L78 Accepts]: Start accepts. Automaton has 81602 states and 127540 transitions. Word has length 359 [2019-10-02 14:14:49,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:49,915 INFO L475 AbstractCegarLoop]: Abstraction has 81602 states and 127540 transitions. [2019-10-02 14:14:49,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 14:14:49,915 INFO L276 IsEmpty]: Start isEmpty. Operand 81602 states and 127540 transitions. [2019-10-02 14:14:50,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-10-02 14:14:50,028 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:50,028 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-02 14:14:50,028 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:50,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:50,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1231785905, now seen corresponding path program 1 times [2019-10-02 14:14:50,029 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:50,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:50,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:50,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:50,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:50,203 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-02 14:14:50,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:14:50,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:14:50,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:14:50,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:14:50,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:14:50,204 INFO L87 Difference]: Start difference. First operand 81602 states and 127540 transitions. Second operand 6 states. [2019-10-02 14:14:52,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:52,904 INFO L93 Difference]: Finished difference Result 158884 states and 248078 transitions. [2019-10-02 14:14:52,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 14:14:52,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 356 [2019-10-02 14:14:52,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:53,172 INFO L225 Difference]: With dead ends: 158884 [2019-10-02 14:14:53,173 INFO L226 Difference]: Without dead ends: 81608 [2019-10-02 14:14:56,716 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:14:56,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81608 states. [2019-10-02 14:14:59,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81608 to 81602. [2019-10-02 14:14:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81602 states. [2019-10-02 14:14:59,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81602 states to 81602 states and 127139 transitions. [2019-10-02 14:14:59,753 INFO L78 Accepts]: Start accepts. Automaton has 81602 states and 127139 transitions. Word has length 356 [2019-10-02 14:14:59,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:59,753 INFO L475 AbstractCegarLoop]: Abstraction has 81602 states and 127139 transitions. [2019-10-02 14:14:59,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:14:59,753 INFO L276 IsEmpty]: Start isEmpty. Operand 81602 states and 127139 transitions. [2019-10-02 14:14:59,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-10-02 14:14:59,875 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:59,875 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:14:59,875 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:59,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:59,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1288810675, now seen corresponding path program 1 times [2019-10-02 14:14:59,876 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:59,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:59,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:59,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:59,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-10-02 14:15:00,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:00,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:15:00,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:15:00,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:15:00,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:15:00,062 INFO L87 Difference]: Start difference. First operand 81602 states and 127139 transitions. Second operand 6 states. [2019-10-02 14:15:05,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:05,703 INFO L93 Difference]: Finished difference Result 158859 states and 247259 transitions. [2019-10-02 14:15:05,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 14:15:05,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 377 [2019-10-02 14:15:05,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:05,931 INFO L225 Difference]: With dead ends: 158859 [2019-10-02 14:15:05,931 INFO L226 Difference]: Without dead ends: 81608 [2019-10-02 14:15:06,051 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:15:06,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81608 states. [2019-10-02 14:15:08,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81608 to 81602. [2019-10-02 14:15:08,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81602 states. [2019-10-02 14:15:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81602 states to 81602 states and 126738 transitions. [2019-10-02 14:15:09,179 INFO L78 Accepts]: Start accepts. Automaton has 81602 states and 126738 transitions. Word has length 377 [2019-10-02 14:15:09,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:09,179 INFO L475 AbstractCegarLoop]: Abstraction has 81602 states and 126738 transitions. [2019-10-02 14:15:09,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:15:09,180 INFO L276 IsEmpty]: Start isEmpty. Operand 81602 states and 126738 transitions. [2019-10-02 14:15:09,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-10-02 14:15:09,314 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:09,314 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:09,314 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:09,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:09,315 INFO L82 PathProgramCache]: Analyzing trace with hash -928028315, now seen corresponding path program 1 times [2019-10-02 14:15:09,315 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:09,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:09,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:09,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:09,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:09,570 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-10-02 14:15:09,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:09,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:15:09,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:15:09,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:15:09,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:15:09,571 INFO L87 Difference]: Start difference. First operand 81602 states and 126738 transitions. Second operand 8 states. [2019-10-02 14:15:19,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:19,490 INFO L93 Difference]: Finished difference Result 244144 states and 404008 transitions. [2019-10-02 14:15:19,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:15:19,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 395 [2019-10-02 14:15:19,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:20,118 INFO L225 Difference]: With dead ends: 244144 [2019-10-02 14:15:20,118 INFO L226 Difference]: Without dead ends: 163245 [2019-10-02 14:15:20,313 INFO L640 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-10-02 14:15:20,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163245 states. [2019-10-02 14:15:32,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163245 to 152041. [2019-10-02 14:15:32,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152041 states. [2019-10-02 14:15:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152041 states to 152041 states and 249833 transitions. [2019-10-02 14:15:33,110 INFO L78 Accepts]: Start accepts. Automaton has 152041 states and 249833 transitions. Word has length 395 [2019-10-02 14:15:33,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:33,110 INFO L475 AbstractCegarLoop]: Abstraction has 152041 states and 249833 transitions. [2019-10-02 14:15:33,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:15:33,110 INFO L276 IsEmpty]: Start isEmpty. Operand 152041 states and 249833 transitions. [2019-10-02 14:15:33,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-10-02 14:15:33,452 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:33,452 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:33,452 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:33,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:33,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1434635736, now seen corresponding path program 1 times [2019-10-02 14:15:33,453 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:33,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:33,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:33,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:33,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:34,398 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-10-02 14:15:34,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:34,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:15:34,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:15:34,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:15:34,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:15:34,400 INFO L87 Difference]: Start difference. First operand 152041 states and 249833 transitions. Second operand 8 states. [2019-10-02 14:15:54,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:54,857 INFO L93 Difference]: Finished difference Result 449905 states and 785905 transitions. [2019-10-02 14:15:54,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:15:54,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 396 [2019-10-02 14:15:54,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:55,948 INFO L225 Difference]: With dead ends: 449905 [2019-10-02 14:15:55,948 INFO L226 Difference]: Without dead ends: 301747 [2019-10-02 14:15:56,276 INFO L640 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-10-02 14:15:56,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301747 states. [2019-10-02 14:16:17,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301747 to 287428. [2019-10-02 14:16:17,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287428 states. [2019-10-02 14:16:18,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287428 states to 287428 states and 498362 transitions. [2019-10-02 14:16:18,658 INFO L78 Accepts]: Start accepts. Automaton has 287428 states and 498362 transitions. Word has length 396 [2019-10-02 14:16:18,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:18,659 INFO L475 AbstractCegarLoop]: Abstraction has 287428 states and 498362 transitions. [2019-10-02 14:16:18,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:16:18,659 INFO L276 IsEmpty]: Start isEmpty. Operand 287428 states and 498362 transitions. [2019-10-02 14:16:29,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-10-02 14:16:29,116 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:29,117 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:16:29,117 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:29,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:29,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1193442655, now seen corresponding path program 1 times [2019-10-02 14:16:29,117 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:29,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:29,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:29,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:29,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:29,335 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-02 14:16:29,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:16:29,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:16:29,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:16:29,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:16:29,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:16:29,337 INFO L87 Difference]: Start difference. First operand 287428 states and 498362 transitions. Second operand 8 states. [2019-10-02 14:17:05,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:17:05,823 INFO L93 Difference]: Finished difference Result 848536 states and 1560370 transitions. [2019-10-02 14:17:05,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:17:05,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 398 [2019-10-02 14:17:05,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:17:08,304 INFO L225 Difference]: With dead ends: 848536 [2019-10-02 14:17:08,304 INFO L226 Difference]: Without dead ends: 569494 [2019-10-02 14:17:09,125 INFO L640 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-10-02 14:17:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569494 states. [2019-10-02 14:18:09,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569494 to 550902. [2019-10-02 14:18:09,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550902 states. [2019-10-02 14:18:12,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550902 states to 550902 states and 1004673 transitions. [2019-10-02 14:18:13,047 INFO L78 Accepts]: Start accepts. Automaton has 550902 states and 1004673 transitions. Word has length 398 [2019-10-02 14:18:13,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:18:13,048 INFO L475 AbstractCegarLoop]: Abstraction has 550902 states and 1004673 transitions. [2019-10-02 14:18:13,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:18:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 550902 states and 1004673 transitions. [2019-10-02 14:18:26,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-10-02 14:18:26,819 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:18:26,819 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:18:26,819 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:18:26,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:18:26,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1242245033, now seen corresponding path program 1 times [2019-10-02 14:18:26,820 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:18:26,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:18:26,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:18:26,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:18:26,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:18:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:18:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-10-02 14:18:27,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:18:27,056 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:18:27,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:18:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:18:27,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 3778 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:18:27,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:18:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-10-02 14:18:28,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:18:28,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-10-02 14:18:28,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 14:18:28,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 14:18:28,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:18:28,730 INFO L87 Difference]: Start difference. First operand 550902 states and 1004673 transitions. Second operand 13 states. [2019-10-02 14:19:17,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:19:17,106 INFO L93 Difference]: Finished difference Result 1058530 states and 1939540 transitions. [2019-10-02 14:19:17,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:19:17,106 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 380 [2019-10-02 14:19:17,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:19:19,675 INFO L225 Difference]: With dead ends: 1058530 [2019-10-02 14:19:19,676 INFO L226 Difference]: Without dead ends: 514205 [2019-10-02 14:19:22,998 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2019-10-02 14:19:23,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514205 states. [2019-10-02 14:20:10,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514205 to 468985. [2019-10-02 14:20:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468985 states. [2019-10-02 14:20:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468985 states to 468985 states and 886506 transitions. [2019-10-02 14:20:28,883 INFO L78 Accepts]: Start accepts. Automaton has 468985 states and 886506 transitions. Word has length 380 [2019-10-02 14:20:28,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:20:28,883 INFO L475 AbstractCegarLoop]: Abstraction has 468985 states and 886506 transitions. [2019-10-02 14:20:28,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 14:20:28,884 INFO L276 IsEmpty]: Start isEmpty. Operand 468985 states and 886506 transitions. [2019-10-02 14:20:33,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-10-02 14:20:33,316 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:20:33,317 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:20:33,317 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:20:33,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:20:33,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1782066492, now seen corresponding path program 1 times [2019-10-02 14:20:33,318 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:20:33,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:20:33,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:20:33,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:20:33,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:20:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:20:34,337 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-02 14:20:34,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:20:34,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 14:20:34,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:20:34,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:20:34,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:20:34,340 INFO L87 Difference]: Start difference. First operand 468985 states and 886506 transitions. Second operand 12 states.