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_spec4_product18.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:23:39,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:23:39,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:23:39,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:23:39,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:23:39,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:23:39,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:23:39,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:23:39,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:23:39,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:23:39,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:23:39,149 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:23:39,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:23:39,150 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:23:39,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:23:39,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:23:39,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:23:39,155 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:23:39,157 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:23:39,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:23:39,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:23:39,162 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:23:39,163 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:23:39,164 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:23:39,166 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:23:39,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:23:39,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:23:39,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:23:39,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:23:39,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:23:39,170 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:23:39,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:23:39,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:23:39,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:23:39,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:23:39,173 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:23:39,174 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:23:39,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:23:39,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:23:39,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:23:39,176 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:23:39,178 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 13:23:39,206 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:23:39,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:23:39,211 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:23:39,211 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:23:39,212 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:23:39,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:23:39,212 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:23:39,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:23:39,213 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:23:39,213 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:23:39,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:23:39,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:23:39,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:23:39,214 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:23:39,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:23:39,214 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:23:39,215 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:23:39,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:23:39,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:23:39,216 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:23:39,217 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:23:39,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:23:39,217 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:23:39,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:23:39,218 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:23:39,218 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:23:39,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:23:39,218 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:23:39,218 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:23:39,260 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:23:39,272 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:23:39,276 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:23:39,278 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:23:39,278 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:23:39,281 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec4_product18.cil.c [2019-10-02 13:23:39,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0f2d7154/1f64a27859554af680c99a0c635ce238/FLAGe5c36ba6a [2019-10-02 13:23:40,006 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:23:40,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec4_product18.cil.c [2019-10-02 13:23:40,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0f2d7154/1f64a27859554af680c99a0c635ce238/FLAGe5c36ba6a [2019-10-02 13:23:40,190 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0f2d7154/1f64a27859554af680c99a0c635ce238 [2019-10-02 13:23:40,199 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:23:40,201 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:23:40,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:23:40,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:23:40,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:23:40,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:23:40" (1/1) ... [2019-10-02 13:23:40,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d32cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:40, skipping insertion in model container [2019-10-02 13:23:40,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:23:40" (1/1) ... [2019-10-02 13:23:40,216 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:23:40,304 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:23:41,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:23:41,120 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:23:41,266 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:23:41,390 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:23:41,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:41 WrapperNode [2019-10-02 13:23:41,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:23:41,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:23:41,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:23:41,392 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:23:41,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:41" (1/1) ... [2019-10-02 13:23:41,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:41" (1/1) ... [2019-10-02 13:23:41,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:41" (1/1) ... [2019-10-02 13:23:41,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:41" (1/1) ... [2019-10-02 13:23:41,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:41" (1/1) ... [2019-10-02 13:23:41,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:41" (1/1) ... [2019-10-02 13:23:41,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:41" (1/1) ... [2019-10-02 13:23:41,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:23:41,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:23:41,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:23:41,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:23:41,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:41" (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 13:23:41,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:23:41,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:23:41,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:23:41,708 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:23:41,708 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:23:41,708 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:23:41,708 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:23:41,709 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:23:41,709 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:23:41,709 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:23:41,709 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:23:41,710 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:23:41,710 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:23:41,710 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:23:41,710 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:23:41,711 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:23:41,711 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:23:41,711 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:23:41,711 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:23:41,712 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:23:41,712 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:23:41,714 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:23:41,715 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:23:41,715 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:23:41,715 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:23:41,715 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:23:41,716 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:23:41,716 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:23:41,716 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:23:41,716 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:23:41,717 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:23:41,717 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:23:41,717 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:23:41,717 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:23:41,718 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:23:41,718 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:23:41,718 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:23:41,718 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:23:41,719 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:23:41,719 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:23:41,719 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:23:41,719 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:23:41,719 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:23:41,720 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:23:41,720 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:23:41,720 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:23:41,720 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:23:41,721 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:23:41,721 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:23:41,721 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:23:41,721 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:23:41,722 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:23:41,722 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:23:41,722 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:23:41,722 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:23:41,722 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:23:41,722 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:23:41,723 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:23:41,723 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:23:41,724 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:23:41,724 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:23:41,724 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:23:41,724 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:23:41,724 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:23:41,725 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:23:41,725 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:23:41,725 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:23:41,725 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:23:41,726 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:23:41,726 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:23:41,726 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:23:41,727 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:23:41,727 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 13:23:41,727 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AutoResponder [2019-10-02 13:23:41,728 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-02 13:23:41,728 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:23:41,728 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:23:41,728 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:23:41,729 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:23:41,729 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:23:41,729 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:23:41,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:23:41,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:23:41,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:23:41,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:23:41,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:23:41,731 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:23:41,732 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:23:41,733 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:23:41,733 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:23:41,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignForward_spec__1 [2019-10-02 13:23:41,734 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:23:41,734 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:23:41,734 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:23:41,735 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:23:41,735 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Keys [2019-10-02 13:23:41,735 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 13:23:41,735 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:23:41,736 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:23:41,736 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:23:41,736 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:23:41,736 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:23:41,736 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:23:41,737 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:23:41,737 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:23:41,737 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:23:41,737 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 13:23:41,737 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:23:41,738 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:23:41,738 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:23:41,738 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:23:41,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:23:41,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:23:41,739 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:23:41,739 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:23:41,739 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:23:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:23:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:23:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:23:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:23:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:23:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:23:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:23:41,742 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:23:41,743 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:23:41,743 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:23:41,743 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:23:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:23:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:23:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:23:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:23:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:23:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:23:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:23:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:23:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:23:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:23:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:23:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:23:41,747 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:23:41,751 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:23:41,751 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:23:41,752 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:23:41,752 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:23:41,761 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:23:41,761 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:23:41,761 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:23:41,762 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:23:41,762 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:23:41,762 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:23:41,762 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:23:41,762 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:23:41,763 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:23:41,763 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:23:41,763 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:23:41,764 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:23:41,764 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:23:41,765 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:23:41,765 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:23:41,765 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:23:41,765 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:23:41,765 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:23:41,766 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:23:41,766 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:23:41,766 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:23:41,766 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:23:41,766 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:23:41,766 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:23:41,767 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:23:41,767 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:23:41,767 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:23:41,767 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:23:41,767 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:23:41,767 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:23:41,767 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:23:41,768 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:23:41,768 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:23:41,768 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:23:41,768 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:23:41,768 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:23:41,768 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:23:41,768 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:23:41,769 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:23:41,769 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:23:41,769 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:23:41,769 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:23:41,769 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:23:41,769 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:23:41,769 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:23:41,770 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:23:41,770 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:23:41,770 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 13:23:41,770 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:23:41,770 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:23:41,770 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:23:41,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:23:41,770 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:23:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:23:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:23:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:23:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AutoResponder [2019-10-02 13:23:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-02 13:23:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:23:41,772 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:23:41,772 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:23:41,772 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:23:41,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:23:41,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:23:41,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:23:41,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:23:41,774 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:23:41,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:23:41,774 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:23:41,775 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:23:41,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:23:41,775 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:23:41,775 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:23:41,775 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:23:41,775 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:23:41,775 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:23:41,775 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignForward_spec__1 [2019-10-02 13:23:41,776 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:23:41,776 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:23:41,776 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:23:41,776 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:23:41,776 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:23:41,776 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:23:41,776 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 13:23:41,776 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:23:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:23:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:23:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Keys [2019-10-02 13:23:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 13:23:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:23:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:23:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:23:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:23:44,179 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:23:44,180 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:23:44,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:23:44 BoogieIcfgContainer [2019-10-02 13:23:44,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:23:44,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:23:44,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:23:44,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:23:44,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:23:40" (1/3) ... [2019-10-02 13:23:44,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e973b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:23:44, skipping insertion in model container [2019-10-02 13:23:44,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:41" (2/3) ... [2019-10-02 13:23:44,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e973b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:23:44, skipping insertion in model container [2019-10-02 13:23:44,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:23:44" (3/3) ... [2019-10-02 13:23:44,191 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec4_product18.cil.c [2019-10-02 13:23:44,202 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:23:44,216 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:23:44,234 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:23:44,284 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:23:44,285 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:23:44,285 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:23:44,285 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:23:44,285 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:23:44,285 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:23:44,285 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:23:44,285 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:23:44,285 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:23:44,325 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states. [2019-10-02 13:23:44,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 13:23:44,364 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:44,366 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:44,368 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:44,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:44,376 INFO L82 PathProgramCache]: Analyzing trace with hash -463084793, now seen corresponding path program 1 times [2019-10-02 13:23:44,377 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:44,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:44,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:44,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:44,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:23:44,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:44,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:23:44,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:23:44,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:23:44,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:23:44,979 INFO L87 Difference]: Start difference. First operand 482 states. Second operand 2 states. [2019-10-02 13:23:45,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:45,100 INFO L93 Difference]: Finished difference Result 662 states and 869 transitions. [2019-10-02 13:23:45,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:23:45,102 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 148 [2019-10-02 13:23:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:45,146 INFO L225 Difference]: With dead ends: 662 [2019-10-02 13:23:45,146 INFO L226 Difference]: Without dead ends: 437 [2019-10-02 13:23:45,158 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 13:23:45,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-10-02 13:23:45,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2019-10-02 13:23:45,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-10-02 13:23:45,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 579 transitions. [2019-10-02 13:23:45,266 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 579 transitions. Word has length 148 [2019-10-02 13:23:45,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:45,268 INFO L475 AbstractCegarLoop]: Abstraction has 437 states and 579 transitions. [2019-10-02 13:23:45,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:23:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 579 transitions. [2019-10-02 13:23:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 13:23:45,276 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:45,277 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:45,277 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:45,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:45,278 INFO L82 PathProgramCache]: Analyzing trace with hash -348931153, now seen corresponding path program 1 times [2019-10-02 13:23:45,278 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:45,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:45,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:45,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:45,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:45,570 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:23:45,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:45,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:23:45,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:23:45,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:23:45,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:45,573 INFO L87 Difference]: Start difference. First operand 437 states and 579 transitions. Second operand 3 states. [2019-10-02 13:23:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:45,631 INFO L93 Difference]: Finished difference Result 645 states and 838 transitions. [2019-10-02 13:23:45,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:23:45,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-02 13:23:45,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:45,637 INFO L225 Difference]: With dead ends: 645 [2019-10-02 13:23:45,638 INFO L226 Difference]: Without dead ends: 440 [2019-10-02 13:23:45,640 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 13:23:45,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-10-02 13:23:45,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 439. [2019-10-02 13:23:45,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-10-02 13:23:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 581 transitions. [2019-10-02 13:23:45,672 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 581 transitions. Word has length 149 [2019-10-02 13:23:45,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:45,675 INFO L475 AbstractCegarLoop]: Abstraction has 439 states and 581 transitions. [2019-10-02 13:23:45,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:23:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 581 transitions. [2019-10-02 13:23:45,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 13:23:45,679 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:45,679 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:45,679 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:45,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:45,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1648155391, now seen corresponding path program 1 times [2019-10-02 13:23:45,680 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:45,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:45,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:45,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:45,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:23:45,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:45,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:23:45,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:23:45,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:23:45,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:45,938 INFO L87 Difference]: Start difference. First operand 439 states and 581 transitions. Second operand 3 states. [2019-10-02 13:23:46,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:46,004 INFO L93 Difference]: Finished difference Result 854 states and 1160 transitions. [2019-10-02 13:23:46,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:23:46,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-02 13:23:46,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:46,014 INFO L225 Difference]: With dead ends: 854 [2019-10-02 13:23:46,014 INFO L226 Difference]: Without dead ends: 480 [2019-10-02 13:23:46,017 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 13:23:46,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-10-02 13:23:46,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 479. [2019-10-02 13:23:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-10-02 13:23:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 650 transitions. [2019-10-02 13:23:46,085 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 650 transitions. Word has length 159 [2019-10-02 13:23:46,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:46,088 INFO L475 AbstractCegarLoop]: Abstraction has 479 states and 650 transitions. [2019-10-02 13:23:46,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:23:46,088 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 650 transitions. [2019-10-02 13:23:46,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 13:23:46,096 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:46,097 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:46,097 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:46,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:46,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1008974663, now seen corresponding path program 1 times [2019-10-02 13:23:46,098 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:46,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:46,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:46,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:46,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:23:46,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:46,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:23:46,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:23:46,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:23:46,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:46,419 INFO L87 Difference]: Start difference. First operand 479 states and 650 transitions. Second operand 3 states. [2019-10-02 13:23:46,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:46,477 INFO L93 Difference]: Finished difference Result 971 states and 1362 transitions. [2019-10-02 13:23:46,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:23:46,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-10-02 13:23:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:46,490 INFO L225 Difference]: With dead ends: 971 [2019-10-02 13:23:46,490 INFO L226 Difference]: Without dead ends: 557 [2019-10-02 13:23:46,496 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 13:23:46,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-10-02 13:23:46,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 556. [2019-10-02 13:23:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-10-02 13:23:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 782 transitions. [2019-10-02 13:23:46,557 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 782 transitions. Word has length 160 [2019-10-02 13:23:46,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:46,557 INFO L475 AbstractCegarLoop]: Abstraction has 556 states and 782 transitions. [2019-10-02 13:23:46,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:23:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 782 transitions. [2019-10-02 13:23:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 13:23:46,563 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:46,564 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:46,564 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:46,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:46,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1166153695, now seen corresponding path program 1 times [2019-10-02 13:23:46,565 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:46,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:46,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:46,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:46,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:46,745 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:23:46,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:46,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:23:46,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:23:46,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:23:46,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:46,747 INFO L87 Difference]: Start difference. First operand 556 states and 782 transitions. Second operand 3 states. [2019-10-02 13:23:46,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:46,794 INFO L93 Difference]: Finished difference Result 1196 states and 1748 transitions. [2019-10-02 13:23:46,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:23:46,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-02 13:23:46,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:46,800 INFO L225 Difference]: With dead ends: 1196 [2019-10-02 13:23:46,800 INFO L226 Difference]: Without dead ends: 705 [2019-10-02 13:23:46,802 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 13:23:46,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-10-02 13:23:46,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 704. [2019-10-02 13:23:46,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-10-02 13:23:46,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1034 transitions. [2019-10-02 13:23:46,837 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1034 transitions. Word has length 161 [2019-10-02 13:23:46,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:46,837 INFO L475 AbstractCegarLoop]: Abstraction has 704 states and 1034 transitions. [2019-10-02 13:23:46,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:23:46,837 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1034 transitions. [2019-10-02 13:23:46,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 13:23:46,842 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:46,842 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:46,842 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:46,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:46,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1633120217, now seen corresponding path program 1 times [2019-10-02 13:23:46,843 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:46,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:46,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:46,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:46,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:23:46,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:46,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:23:46,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:23:46,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:23:46,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:46,977 INFO L87 Difference]: Start difference. First operand 704 states and 1034 transitions. Second operand 3 states. [2019-10-02 13:23:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:47,033 INFO L93 Difference]: Finished difference Result 1628 states and 2484 transitions. [2019-10-02 13:23:47,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:23:47,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-10-02 13:23:47,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:47,041 INFO L225 Difference]: With dead ends: 1628 [2019-10-02 13:23:47,042 INFO L226 Difference]: Without dead ends: 989 [2019-10-02 13:23:47,044 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 13:23:47,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-10-02 13:23:47,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 988. [2019-10-02 13:23:47,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-10-02 13:23:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1514 transitions. [2019-10-02 13:23:47,103 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1514 transitions. Word has length 162 [2019-10-02 13:23:47,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:47,104 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1514 transitions. [2019-10-02 13:23:47,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:23:47,105 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1514 transitions. [2019-10-02 13:23:47,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 13:23:47,111 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:47,111 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:47,112 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:47,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:47,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1343280992, now seen corresponding path program 1 times [2019-10-02 13:23:47,113 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:47,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:47,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:47,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:47,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 13:23:47,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:47,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:23:47,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:23:47,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:23:47,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:23:47,373 INFO L87 Difference]: Start difference. First operand 988 states and 1514 transitions. Second operand 7 states. [2019-10-02 13:23:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:49,745 INFO L93 Difference]: Finished difference Result 1390 states and 2021 transitions. [2019-10-02 13:23:49,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:23:49,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 165 [2019-10-02 13:23:49,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:49,753 INFO L225 Difference]: With dead ends: 1390 [2019-10-02 13:23:49,754 INFO L226 Difference]: Without dead ends: 1196 [2019-10-02 13:23:49,755 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:23:49,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2019-10-02 13:23:49,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1187. [2019-10-02 13:23:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1187 states. [2019-10-02 13:23:49,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1766 transitions. [2019-10-02 13:23:49,817 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1766 transitions. Word has length 165 [2019-10-02 13:23:49,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:49,818 INFO L475 AbstractCegarLoop]: Abstraction has 1187 states and 1766 transitions. [2019-10-02 13:23:49,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:23:49,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1766 transitions. [2019-10-02 13:23:49,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 13:23:49,824 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:49,825 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:49,825 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:49,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:49,825 INFO L82 PathProgramCache]: Analyzing trace with hash 217268504, now seen corresponding path program 1 times [2019-10-02 13:23:49,826 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:49,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:49,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:49,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:49,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 13:23:50,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:50,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-02 13:23:50,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 13:23:50,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 13:23:50,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:23:50,102 INFO L87 Difference]: Start difference. First operand 1187 states and 1766 transitions. Second operand 16 states. [2019-10-02 13:23:50,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:50,495 INFO L93 Difference]: Finished difference Result 1636 states and 2340 transitions. [2019-10-02 13:23:50,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:23:50,496 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 166 [2019-10-02 13:23:50,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:50,505 INFO L225 Difference]: With dead ends: 1636 [2019-10-02 13:23:50,505 INFO L226 Difference]: Without dead ends: 1219 [2019-10-02 13:23:50,510 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:23:50,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2019-10-02 13:23:50,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1215. [2019-10-02 13:23:50,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2019-10-02 13:23:50,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1801 transitions. [2019-10-02 13:23:50,574 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1801 transitions. Word has length 166 [2019-10-02 13:23:50,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:50,577 INFO L475 AbstractCegarLoop]: Abstraction has 1215 states and 1801 transitions. [2019-10-02 13:23:50,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 13:23:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1801 transitions. [2019-10-02 13:23:50,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 13:23:50,583 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:50,583 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:50,584 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:50,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:50,584 INFO L82 PathProgramCache]: Analyzing trace with hash 138441481, now seen corresponding path program 1 times [2019-10-02 13:23:50,584 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:50,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:50,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:50,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:50,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 13:23:50,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:50,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:23:50,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:23:50,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:23:50,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:23:50,775 INFO L87 Difference]: Start difference. First operand 1215 states and 1801 transitions. Second operand 8 states. [2019-10-02 13:23:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:51,583 INFO L93 Difference]: Finished difference Result 1756 states and 2491 transitions. [2019-10-02 13:23:51,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:23:51,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2019-10-02 13:23:51,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:51,594 INFO L225 Difference]: With dead ends: 1756 [2019-10-02 13:23:51,594 INFO L226 Difference]: Without dead ends: 1669 [2019-10-02 13:23:51,595 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:23:51,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2019-10-02 13:23:51,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1656. [2019-10-02 13:23:51,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2019-10-02 13:23:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2369 transitions. [2019-10-02 13:23:51,687 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2369 transitions. Word has length 175 [2019-10-02 13:23:51,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:51,688 INFO L475 AbstractCegarLoop]: Abstraction has 1656 states and 2369 transitions. [2019-10-02 13:23:51,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:23:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2369 transitions. [2019-10-02 13:23:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 13:23:51,696 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:51,697 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:51,697 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:51,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:51,698 INFO L82 PathProgramCache]: Analyzing trace with hash -868594112, now seen corresponding path program 1 times [2019-10-02 13:23:51,698 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:51,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:51,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:51,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:51,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 13:23:52,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:52,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 13:23:52,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 13:23:52,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 13:23:52,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-02 13:23:52,006 INFO L87 Difference]: Start difference. First operand 1656 states and 2369 transitions. Second operand 15 states. [2019-10-02 13:23:52,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:52,698 INFO L93 Difference]: Finished difference Result 2067 states and 2886 transitions. [2019-10-02 13:23:52,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 13:23:52,699 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 176 [2019-10-02 13:23:52,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:52,714 INFO L225 Difference]: With dead ends: 2067 [2019-10-02 13:23:52,714 INFO L226 Difference]: Without dead ends: 1655 [2019-10-02 13:23:52,718 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2019-10-02 13:23:52,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2019-10-02 13:23:52,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1654. [2019-10-02 13:23:52,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-10-02 13:23:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2364 transitions. [2019-10-02 13:23:52,841 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2364 transitions. Word has length 176 [2019-10-02 13:23:52,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:52,842 INFO L475 AbstractCegarLoop]: Abstraction has 1654 states and 2364 transitions. [2019-10-02 13:23:52,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 13:23:52,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2364 transitions. [2019-10-02 13:23:52,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 13:23:52,852 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:52,853 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:52,853 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:52,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:52,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1230241458, now seen corresponding path program 2 times [2019-10-02 13:23:52,854 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:52,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:52,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:52,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:52,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 13:23:53,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:23:53,144 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 13:23:53,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 13:23:53,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-02 13:23:53,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 13:23:53,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 1924 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 13:23:53,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:23:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 13:23:54,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:23:54,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2019-10-02 13:23:54,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 13:23:54,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 13:23:54,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:23:54,281 INFO L87 Difference]: Start difference. First operand 1654 states and 2364 transitions. Second operand 17 states. [2019-10-02 13:23:56,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:56,617 INFO L93 Difference]: Finished difference Result 3478 states and 4985 transitions. [2019-10-02 13:23:56,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 13:23:56,618 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 176 [2019-10-02 13:23:56,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:56,640 INFO L225 Difference]: With dead ends: 3478 [2019-10-02 13:23:56,640 INFO L226 Difference]: Without dead ends: 2936 [2019-10-02 13:23:56,645 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=1523, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 13:23:56,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2019-10-02 13:23:56,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 2917. [2019-10-02 13:23:56,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2917 states. [2019-10-02 13:23:56,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 4276 transitions. [2019-10-02 13:23:56,852 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 4276 transitions. Word has length 176 [2019-10-02 13:23:56,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:56,852 INFO L475 AbstractCegarLoop]: Abstraction has 2917 states and 4276 transitions. [2019-10-02 13:23:56,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 13:23:56,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 4276 transitions. [2019-10-02 13:23:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-02 13:23:56,870 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:56,871 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:23:56,871 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:56,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:56,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1058178360, now seen corresponding path program 1 times [2019-10-02 13:23:56,872 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:56,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:56,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:56,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:23:56,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 13:23:57,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:57,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:23:57,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:23:57,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:23:57,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:23:57,192 INFO L87 Difference]: Start difference. First operand 2917 states and 4276 transitions. Second operand 8 states. [2019-10-02 13:23:57,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:57,314 INFO L93 Difference]: Finished difference Result 3842 states and 5386 transitions. [2019-10-02 13:23:57,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:23:57,315 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 270 [2019-10-02 13:23:57,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:57,334 INFO L225 Difference]: With dead ends: 3842 [2019-10-02 13:23:57,334 INFO L226 Difference]: Without dead ends: 2917 [2019-10-02 13:23:57,339 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:23:57,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2019-10-02 13:23:57,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2917. [2019-10-02 13:23:57,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2917 states. [2019-10-02 13:23:57,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 4270 transitions. [2019-10-02 13:23:57,530 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 4270 transitions. Word has length 270 [2019-10-02 13:23:57,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:57,531 INFO L475 AbstractCegarLoop]: Abstraction has 2917 states and 4270 transitions. [2019-10-02 13:23:57,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:23:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 4270 transitions. [2019-10-02 13:23:57,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-10-02 13:23:57,551 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:57,552 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:23:57,552 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:57,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:57,553 INFO L82 PathProgramCache]: Analyzing trace with hash -176465461, now seen corresponding path program 1 times [2019-10-02 13:23:57,553 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:57,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:57,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:57,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:57,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 13:23:57,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:57,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 13:23:57,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:23:57,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:23:57,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:23:57,904 INFO L87 Difference]: Start difference. First operand 2917 states and 4270 transitions. Second operand 13 states. [2019-10-02 13:24:00,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:00,390 INFO L93 Difference]: Finished difference Result 6641 states and 9567 transitions. [2019-10-02 13:24:00,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 13:24:00,391 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 277 [2019-10-02 13:24:00,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:00,427 INFO L225 Difference]: With dead ends: 6641 [2019-10-02 13:24:00,427 INFO L226 Difference]: Without dead ends: 5842 [2019-10-02 13:24:00,433 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:24:00,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5842 states. [2019-10-02 13:24:00,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5842 to 5737. [2019-10-02 13:24:00,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5737 states. [2019-10-02 13:24:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5737 states to 5737 states and 8430 transitions. [2019-10-02 13:24:00,785 INFO L78 Accepts]: Start accepts. Automaton has 5737 states and 8430 transitions. Word has length 277 [2019-10-02 13:24:00,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:00,785 INFO L475 AbstractCegarLoop]: Abstraction has 5737 states and 8430 transitions. [2019-10-02 13:24:00,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:24:00,786 INFO L276 IsEmpty]: Start isEmpty. Operand 5737 states and 8430 transitions. [2019-10-02 13:24:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-02 13:24:00,827 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:00,828 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:24:00,828 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:00,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:00,829 INFO L82 PathProgramCache]: Analyzing trace with hash 98653533, now seen corresponding path program 1 times [2019-10-02 13:24:00,829 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:00,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:00,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:00,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:00,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-02 13:24:01,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:24:01,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:24:01,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:24:01,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:24:01,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:24:01,013 INFO L87 Difference]: Start difference. First operand 5737 states and 8430 transitions. Second operand 3 states. [2019-10-02 13:24:01,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:01,340 INFO L93 Difference]: Finished difference Result 13580 states and 20587 transitions. [2019-10-02 13:24:01,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:24:01,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 276 [2019-10-02 13:24:01,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:01,412 INFO L225 Difference]: With dead ends: 13580 [2019-10-02 13:24:01,412 INFO L226 Difference]: Without dead ends: 7917 [2019-10-02 13:24:01,447 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 13:24:01,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7917 states. [2019-10-02 13:24:01,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7917 to 7913. [2019-10-02 13:24:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7913 states. [2019-10-02 13:24:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7913 states to 7913 states and 12174 transitions. [2019-10-02 13:24:01,873 INFO L78 Accepts]: Start accepts. Automaton has 7913 states and 12174 transitions. Word has length 276 [2019-10-02 13:24:01,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:01,874 INFO L475 AbstractCegarLoop]: Abstraction has 7913 states and 12174 transitions. [2019-10-02 13:24:01,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:24:01,875 INFO L276 IsEmpty]: Start isEmpty. Operand 7913 states and 12174 transitions. [2019-10-02 13:24:01,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-02 13:24:01,937 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:01,937 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:24:01,938 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:01,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:01,938 INFO L82 PathProgramCache]: Analyzing trace with hash 675067199, now seen corresponding path program 1 times [2019-10-02 13:24:01,939 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:01,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:01,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:01,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:01,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:02,243 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 13:24:02,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:24:02,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 13:24:02,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:24:02,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:24:02,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:24:02,245 INFO L87 Difference]: Start difference. First operand 7913 states and 12174 transitions. Second operand 11 states. [2019-10-02 13:24:05,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:05,740 INFO L93 Difference]: Finished difference Result 9704 states and 14301 transitions. [2019-10-02 13:24:05,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:24:05,741 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 278 [2019-10-02 13:24:05,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:05,778 INFO L225 Difference]: With dead ends: 9704 [2019-10-02 13:24:05,778 INFO L226 Difference]: Without dead ends: 8241 [2019-10-02 13:24:05,787 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 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 13:24:05,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8241 states. [2019-10-02 13:24:06,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8241 to 7683. [2019-10-02 13:24:06,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7683 states. [2019-10-02 13:24:06,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7683 states to 7683 states and 11847 transitions. [2019-10-02 13:24:06,279 INFO L78 Accepts]: Start accepts. Automaton has 7683 states and 11847 transitions. Word has length 278 [2019-10-02 13:24:06,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:06,280 INFO L475 AbstractCegarLoop]: Abstraction has 7683 states and 11847 transitions. [2019-10-02 13:24:06,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:24:06,280 INFO L276 IsEmpty]: Start isEmpty. Operand 7683 states and 11847 transitions. [2019-10-02 13:24:06,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-02 13:24:06,326 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:06,327 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:24:06,327 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:06,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:06,328 INFO L82 PathProgramCache]: Analyzing trace with hash -455298025, now seen corresponding path program 1 times [2019-10-02 13:24:06,328 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:06,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:06,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:06,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:06,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-02 13:24:06,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:24:06,683 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 13:24:06,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:07,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 3047 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:24:07,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:24:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-02 13:24:07,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:24:07,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-10-02 13:24:07,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 13:24:07,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 13:24:07,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:24:07,633 INFO L87 Difference]: Start difference. First operand 7683 states and 11847 transitions. Second operand 25 states. [2019-10-02 13:24:11,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:11,718 INFO L93 Difference]: Finished difference Result 16049 states and 24524 transitions. [2019-10-02 13:24:11,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 13:24:11,719 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 298 [2019-10-02 13:24:11,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:11,754 INFO L225 Difference]: With dead ends: 16049 [2019-10-02 13:24:11,754 INFO L226 Difference]: Without dead ends: 8354 [2019-10-02 13:24:11,788 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=225, Invalid=2427, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 13:24:11,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8354 states. [2019-10-02 13:24:12,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8354 to 8114. [2019-10-02 13:24:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8114 states. [2019-10-02 13:24:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8114 states to 8114 states and 12349 transitions. [2019-10-02 13:24:12,479 INFO L78 Accepts]: Start accepts. Automaton has 8114 states and 12349 transitions. Word has length 298 [2019-10-02 13:24:12,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:12,480 INFO L475 AbstractCegarLoop]: Abstraction has 8114 states and 12349 transitions. [2019-10-02 13:24:12,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 13:24:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand 8114 states and 12349 transitions. [2019-10-02 13:24:12,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-02 13:24:12,568 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:12,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:24:12,569 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:12,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:12,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1843423735, now seen corresponding path program 1 times [2019-10-02 13:24:12,570 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:12,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:12,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:12,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:12,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:13,370 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 13:24:13,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:24:13,370 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 13:24:13,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:13,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 3046 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:24:13,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:24:14,195 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-02 13:24:14,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:24:14,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [33] total 38 [2019-10-02 13:24:14,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 13:24:14,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 13:24:14,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1329, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 13:24:14,205 INFO L87 Difference]: Start difference. First operand 8114 states and 12349 transitions. Second operand 38 states. [2019-10-02 13:24:19,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:19,913 INFO L93 Difference]: Finished difference Result 16166 states and 24650 transitions. [2019-10-02 13:24:19,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 13:24:19,914 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 297 [2019-10-02 13:24:19,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:19,946 INFO L225 Difference]: With dead ends: 16166 [2019-10-02 13:24:19,947 INFO L226 Difference]: Without dead ends: 7821 [2019-10-02 13:24:19,987 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=315, Invalid=5385, Unknown=0, NotChecked=0, Total=5700 [2019-10-02 13:24:19,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7821 states. [2019-10-02 13:24:20,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7821 to 7817. [2019-10-02 13:24:20,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7817 states. [2019-10-02 13:24:20,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7817 states to 7817 states and 11918 transitions. [2019-10-02 13:24:20,505 INFO L78 Accepts]: Start accepts. Automaton has 7817 states and 11918 transitions. Word has length 297 [2019-10-02 13:24:20,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:20,505 INFO L475 AbstractCegarLoop]: Abstraction has 7817 states and 11918 transitions. [2019-10-02 13:24:20,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 13:24:20,505 INFO L276 IsEmpty]: Start isEmpty. Operand 7817 states and 11918 transitions. [2019-10-02 13:24:20,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-10-02 13:24:20,541 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:20,542 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:24:20,543 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:20,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:20,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1274869482, now seen corresponding path program 1 times [2019-10-02 13:24:20,543 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:20,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:20,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:20,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:20,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 13:24:20,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:24:20,750 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 13:24:20,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:21,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 3089 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:24:21,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:24:21,622 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-02 13:24:21,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:24:21,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 13:24:21,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 13:24:21,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 13:24:21,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-02 13:24:21,631 INFO L87 Difference]: Start difference. First operand 7817 states and 11918 transitions. Second operand 14 states. [2019-10-02 13:24:25,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:25,960 INFO L93 Difference]: Finished difference Result 18290 states and 28362 transitions. [2019-10-02 13:24:25,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 13:24:25,960 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 307 [2019-10-02 13:24:25,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:26,005 INFO L225 Difference]: With dead ends: 18290 [2019-10-02 13:24:26,005 INFO L226 Difference]: Without dead ends: 10501 [2019-10-02 13:24:26,027 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 13:24:26,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10501 states. [2019-10-02 13:24:26,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10501 to 10238. [2019-10-02 13:24:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10238 states. [2019-10-02 13:24:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10238 states to 10238 states and 16143 transitions. [2019-10-02 13:24:26,620 INFO L78 Accepts]: Start accepts. Automaton has 10238 states and 16143 transitions. Word has length 307 [2019-10-02 13:24:26,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:26,620 INFO L475 AbstractCegarLoop]: Abstraction has 10238 states and 16143 transitions. [2019-10-02 13:24:26,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 13:24:26,620 INFO L276 IsEmpty]: Start isEmpty. Operand 10238 states and 16143 transitions. [2019-10-02 13:24:26,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-10-02 13:24:26,658 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:26,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:24:26,658 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:26,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:26,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1806891085, now seen corresponding path program 2 times [2019-10-02 13:24:26,659 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:26,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:26,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:26,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:26,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:27,170 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-02 13:24:27,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:24:27,170 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 13:24:27,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 13:24:27,786 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 13:24:27,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 13:24:27,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 3091 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 13:24:27,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:24:28,036 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 13:24:28,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:24:28,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 25 [2019-10-02 13:24:28,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 13:24:28,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 13:24:28,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:24:28,046 INFO L87 Difference]: Start difference. First operand 10238 states and 16143 transitions. Second operand 25 states. [2019-10-02 13:24:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:41,201 INFO L93 Difference]: Finished difference Result 27733 states and 46063 transitions. [2019-10-02 13:24:41,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-02 13:24:41,202 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 309 [2019-10-02 13:24:41,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:41,338 INFO L225 Difference]: With dead ends: 27733 [2019-10-02 13:24:41,338 INFO L226 Difference]: Without dead ends: 27336 [2019-10-02 13:24:41,358 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=499, Invalid=5981, Unknown=0, NotChecked=0, Total=6480 [2019-10-02 13:24:41,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27336 states. [2019-10-02 13:24:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27336 to 20473. [2019-10-02 13:24:43,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20473 states. [2019-10-02 13:24:43,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20473 states to 20473 states and 33237 transitions. [2019-10-02 13:24:43,904 INFO L78 Accepts]: Start accepts. Automaton has 20473 states and 33237 transitions. Word has length 309 [2019-10-02 13:24:43,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:43,905 INFO L475 AbstractCegarLoop]: Abstraction has 20473 states and 33237 transitions. [2019-10-02 13:24:43,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 13:24:43,905 INFO L276 IsEmpty]: Start isEmpty. Operand 20473 states and 33237 transitions. [2019-10-02 13:24:43,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-10-02 13:24:43,987 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:43,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:24:43,988 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:43,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:43,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1528551256, now seen corresponding path program 1 times [2019-10-02 13:24:43,988 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:43,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:43,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:43,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:24:43,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:44,236 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-02 13:24:44,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:24:44,237 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 13:24:44,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:44,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 3095 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:24:44,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:24:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-02 13:24:45,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:24:45,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2019-10-02 13:24:45,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 13:24:45,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 13:24:45,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:24:45,057 INFO L87 Difference]: Start difference. First operand 20473 states and 33237 transitions. Second operand 19 states. [2019-10-02 13:24:48,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:48,982 INFO L93 Difference]: Finished difference Result 40846 states and 66404 transitions. [2019-10-02 13:24:48,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 13:24:48,983 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 313 [2019-10-02 13:24:48,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:49,055 INFO L225 Difference]: With dead ends: 40846 [2019-10-02 13:24:49,055 INFO L226 Difference]: Without dead ends: 20513 [2019-10-02 13:24:49,113 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=1468, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 13:24:49,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20513 states. [2019-10-02 13:24:50,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20513 to 20481. [2019-10-02 13:24:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20481 states. [2019-10-02 13:24:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20481 states to 20481 states and 33229 transitions. [2019-10-02 13:24:50,094 INFO L78 Accepts]: Start accepts. Automaton has 20481 states and 33229 transitions. Word has length 313 [2019-10-02 13:24:50,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:50,094 INFO L475 AbstractCegarLoop]: Abstraction has 20481 states and 33229 transitions. [2019-10-02 13:24:50,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 13:24:50,094 INFO L276 IsEmpty]: Start isEmpty. Operand 20481 states and 33229 transitions. [2019-10-02 13:24:50,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-02 13:24:50,160 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:50,160 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:24:50,160 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:50,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:50,161 INFO L82 PathProgramCache]: Analyzing trace with hash 142803969, now seen corresponding path program 1 times [2019-10-02 13:24:50,161 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:50,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:50,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:50,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:50,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:50,512 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 13:24:50,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:24:50,512 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 13:24:50,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:51,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 3094 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:24:51,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:24:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-10-02 13:24:51,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:24:51,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 13:24:51,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:24:51,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:24:51,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:24:51,227 INFO L87 Difference]: Start difference. First operand 20481 states and 33229 transitions. Second operand 12 states. [2019-10-02 13:24:52,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:52,706 INFO L93 Difference]: Finished difference Result 35620 states and 57092 transitions. [2019-10-02 13:24:52,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:24:52,707 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 312 [2019-10-02 13:24:52,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:52,753 INFO L225 Difference]: With dead ends: 35620 [2019-10-02 13:24:52,754 INFO L226 Difference]: Without dead ends: 15252 [2019-10-02 13:24:52,812 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:24:52,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15252 states. [2019-10-02 13:24:53,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15252 to 15222. [2019-10-02 13:24:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15222 states. [2019-10-02 13:24:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15222 states to 15222 states and 23960 transitions. [2019-10-02 13:24:53,826 INFO L78 Accepts]: Start accepts. Automaton has 15222 states and 23960 transitions. Word has length 312 [2019-10-02 13:24:53,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:53,827 INFO L475 AbstractCegarLoop]: Abstraction has 15222 states and 23960 transitions. [2019-10-02 13:24:53,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:24:53,827 INFO L276 IsEmpty]: Start isEmpty. Operand 15222 states and 23960 transitions. [2019-10-02 13:24:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-02 13:24:53,880 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:53,880 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:24:53,881 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:53,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:53,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1283160477, now seen corresponding path program 1 times [2019-10-02 13:24:53,881 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:53,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:53,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:53,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:53,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-02 13:24:54,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:24:54,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:24:54,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:24:54,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:24:54,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:24:54,079 INFO L87 Difference]: Start difference. First operand 15222 states and 23960 transitions. Second operand 8 states. [2019-10-02 13:24:59,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:59,324 INFO L93 Difference]: Finished difference Result 33179 states and 51233 transitions. [2019-10-02 13:24:59,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:24:59,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 311 [2019-10-02 13:24:59,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:59,412 INFO L225 Difference]: With dead ends: 33179 [2019-10-02 13:24:59,413 INFO L226 Difference]: Without dead ends: 31760 [2019-10-02 13:24:59,426 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 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 13:24:59,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31760 states. [2019-10-02 13:25:00,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31760 to 30190. [2019-10-02 13:25:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30190 states. [2019-10-02 13:25:00,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30190 states to 30190 states and 47878 transitions. [2019-10-02 13:25:00,724 INFO L78 Accepts]: Start accepts. Automaton has 30190 states and 47878 transitions. Word has length 311 [2019-10-02 13:25:00,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:25:00,725 INFO L475 AbstractCegarLoop]: Abstraction has 30190 states and 47878 transitions. [2019-10-02 13:25:00,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:25:00,725 INFO L276 IsEmpty]: Start isEmpty. Operand 30190 states and 47878 transitions. [2019-10-02 13:25:00,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-02 13:25:00,834 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:25:00,835 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:25:00,835 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:25:00,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:25:00,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1232202229, now seen corresponding path program 1 times [2019-10-02 13:25:00,835 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:25:00,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:25:00,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:00,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:25:00,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-02 13:25:01,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:25:01,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:25:01,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:25:01,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:25:01,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:25:01,239 INFO L87 Difference]: Start difference. First operand 30190 states and 47878 transitions. Second operand 18 states. [2019-10-02 13:25:03,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:25:03,680 INFO L93 Difference]: Finished difference Result 30464 states and 48173 transitions. [2019-10-02 13:25:03,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 13:25:03,680 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 312 [2019-10-02 13:25:03,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:25:03,757 INFO L225 Difference]: With dead ends: 30464 [2019-10-02 13:25:03,758 INFO L226 Difference]: Without dead ends: 30295 [2019-10-02 13:25:03,771 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 13:25:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30295 states. [2019-10-02 13:25:04,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30295 to 30190. [2019-10-02 13:25:04,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30190 states. [2019-10-02 13:25:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30190 states to 30190 states and 47872 transitions. [2019-10-02 13:25:05,040 INFO L78 Accepts]: Start accepts. Automaton has 30190 states and 47872 transitions. Word has length 312 [2019-10-02 13:25:05,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:25:05,041 INFO L475 AbstractCegarLoop]: Abstraction has 30190 states and 47872 transitions. [2019-10-02 13:25:05,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:25:05,041 INFO L276 IsEmpty]: Start isEmpty. Operand 30190 states and 47872 transitions. [2019-10-02 13:25:05,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-10-02 13:25:05,127 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:25:05,127 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:25:05,127 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:25:05,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:25:05,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1964877405, now seen corresponding path program 1 times [2019-10-02 13:25:05,128 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:25:05,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:25:05,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:05,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:25:05,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-02 13:25:06,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:25:06,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:25:06,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:25:06,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:25:06,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:25:06,540 INFO L87 Difference]: Start difference. First operand 30190 states and 47872 transitions. Second operand 8 states. [2019-10-02 13:25:12,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:25:12,151 INFO L93 Difference]: Finished difference Result 64923 states and 101301 transitions. [2019-10-02 13:25:12,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:25:12,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 313 [2019-10-02 13:25:12,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:25:12,312 INFO L225 Difference]: With dead ends: 64923 [2019-10-02 13:25:12,312 INFO L226 Difference]: Without dead ends: 62616 [2019-10-02 13:25:12,334 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:25:12,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62616 states. [2019-10-02 13:25:14,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62616 to 60158. [2019-10-02 13:25:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60158 states. [2019-10-02 13:25:15,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60158 states to 60158 states and 95972 transitions. [2019-10-02 13:25:15,073 INFO L78 Accepts]: Start accepts. Automaton has 60158 states and 95972 transitions. Word has length 313 [2019-10-02 13:25:15,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:25:15,073 INFO L475 AbstractCegarLoop]: Abstraction has 60158 states and 95972 transitions. [2019-10-02 13:25:15,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:25:15,073 INFO L276 IsEmpty]: Start isEmpty. Operand 60158 states and 95972 transitions. [2019-10-02 13:25:15,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-10-02 13:25:15,260 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:25:15,260 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:25:15,260 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:25:15,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:25:15,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1500732517, now seen corresponding path program 1 times [2019-10-02 13:25:15,261 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:25:15,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:25:15,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:15,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:25:15,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 13:25:15,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:25:15,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-10-02 13:25:15,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 13:25:15,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 13:25:15,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:25:15,610 INFO L87 Difference]: Start difference. First operand 60158 states and 95972 transitions. Second operand 22 states. [2019-10-02 13:25:23,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:25:23,472 INFO L93 Difference]: Finished difference Result 60172 states and 95984 transitions. [2019-10-02 13:25:23,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 13:25:23,472 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 313 [2019-10-02 13:25:23,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:25:23,627 INFO L225 Difference]: With dead ends: 60172 [2019-10-02 13:25:23,628 INFO L226 Difference]: Without dead ends: 60163 [2019-10-02 13:25:23,649 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=1510, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 13:25:23,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60163 states. [2019-10-02 13:25:26,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60163 to 50818. [2019-10-02 13:25:26,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50818 states. [2019-10-02 13:25:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50818 states to 50818 states and 84629 transitions. [2019-10-02 13:25:26,214 INFO L78 Accepts]: Start accepts. Automaton has 50818 states and 84629 transitions. Word has length 313 [2019-10-02 13:25:26,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:25:26,214 INFO L475 AbstractCegarLoop]: Abstraction has 50818 states and 84629 transitions. [2019-10-02 13:25:26,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 13:25:26,215 INFO L276 IsEmpty]: Start isEmpty. Operand 50818 states and 84629 transitions. [2019-10-02 13:25:26,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-10-02 13:25:26,389 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:25:26,389 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:25:26,389 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:25:26,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:25:26,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1752425211, now seen corresponding path program 1 times [2019-10-02 13:25:26,389 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:25:26,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:25:26,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:26,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:25:26,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-02 13:25:26,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:25:26,693 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 13:25:26,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:25:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:27,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 3086 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:25:27,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:25:27,483 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-02 13:25:27,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:25:27,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2019-10-02 13:25:27,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 13:25:27,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 13:25:27,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-10-02 13:25:27,492 INFO L87 Difference]: Start difference. First operand 50818 states and 84629 transitions. Second operand 23 states. [2019-10-02 13:25:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:25:31,745 INFO L93 Difference]: Finished difference Result 81862 states and 133158 transitions. [2019-10-02 13:25:31,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 13:25:31,745 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 313 [2019-10-02 13:25:31,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:25:31,826 INFO L225 Difference]: With dead ends: 81862 [2019-10-02 13:25:31,826 INFO L226 Difference]: Without dead ends: 31115 [2019-10-02 13:25:31,904 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=2051, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 13:25:31,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31115 states. [2019-10-02 13:25:33,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31115 to 30976. [2019-10-02 13:25:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30976 states. [2019-10-02 13:25:33,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30976 states to 30976 states and 48422 transitions. [2019-10-02 13:25:33,241 INFO L78 Accepts]: Start accepts. Automaton has 30976 states and 48422 transitions. Word has length 313 [2019-10-02 13:25:33,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:25:33,242 INFO L475 AbstractCegarLoop]: Abstraction has 30976 states and 48422 transitions. [2019-10-02 13:25:33,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 13:25:33,242 INFO L276 IsEmpty]: Start isEmpty. Operand 30976 states and 48422 transitions. [2019-10-02 13:25:33,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-10-02 13:25:33,321 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:25:33,322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:25:33,322 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:25:33,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:25:33,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1760093441, now seen corresponding path program 1 times [2019-10-02 13:25:33,322 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:25:33,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:25:33,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:33,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:25:33,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 13:25:33,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:25:33,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-10-02 13:25:33,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 13:25:33,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 13:25:33,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:25:33,687 INFO L87 Difference]: Start difference. First operand 30976 states and 48422 transitions. Second operand 22 states. [2019-10-02 13:25:36,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:25:36,607 INFO L93 Difference]: Finished difference Result 31070 states and 48526 transitions. [2019-10-02 13:25:36,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 13:25:36,608 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 315 [2019-10-02 13:25:36,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:25:36,685 INFO L225 Difference]: With dead ends: 31070 [2019-10-02 13:25:36,685 INFO L226 Difference]: Without dead ends: 30546 [2019-10-02 13:25:36,700 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=1362, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 13:25:36,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30546 states. [2019-10-02 13:25:37,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30546 to 28311. [2019-10-02 13:25:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28311 states. [2019-10-02 13:25:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28311 states to 28311 states and 45222 transitions. [2019-10-02 13:25:37,976 INFO L78 Accepts]: Start accepts. Automaton has 28311 states and 45222 transitions. Word has length 315 [2019-10-02 13:25:37,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:25:37,976 INFO L475 AbstractCegarLoop]: Abstraction has 28311 states and 45222 transitions. [2019-10-02 13:25:37,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 13:25:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 28311 states and 45222 transitions. [2019-10-02 13:25:38,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-10-02 13:25:38,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:25:38,060 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:25:38,060 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:25:38,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:25:38,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1184088337, now seen corresponding path program 1 times [2019-10-02 13:25:38,061 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:25:38,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:25:38,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:38,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:25:38,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 13:25:38,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:25:38,405 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 13:25:38,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:25:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:39,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 3097 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:25:39,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:25:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-10-02 13:25:39,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:25:39,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2019-10-02 13:25:39,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 13:25:39,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 13:25:39,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-10-02 13:25:39,380 INFO L87 Difference]: Start difference. First operand 28311 states and 45222 transitions. Second operand 23 states. [2019-10-02 13:25:43,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:25:43,238 INFO L93 Difference]: Finished difference Result 57149 states and 91030 transitions. [2019-10-02 13:25:43,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 13:25:43,239 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 316 [2019-10-02 13:25:43,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:25:43,317 INFO L225 Difference]: With dead ends: 57149 [2019-10-02 13:25:43,317 INFO L226 Difference]: Without dead ends: 27963 [2019-10-02 13:25:43,364 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=2051, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 13:25:43,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27963 states. [2019-10-02 13:25:44,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27963 to 27902. [2019-10-02 13:25:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27902 states. [2019-10-02 13:25:44,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27902 states to 27902 states and 44666 transitions. [2019-10-02 13:25:44,944 INFO L78 Accepts]: Start accepts. Automaton has 27902 states and 44666 transitions. Word has length 316 [2019-10-02 13:25:44,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:25:44,945 INFO L475 AbstractCegarLoop]: Abstraction has 27902 states and 44666 transitions. [2019-10-02 13:25:44,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 13:25:44,945 INFO L276 IsEmpty]: Start isEmpty. Operand 27902 states and 44666 transitions. [2019-10-02 13:25:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-10-02 13:25:45,019 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:25:45,020 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:25:45,020 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:25:45,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:25:45,020 INFO L82 PathProgramCache]: Analyzing trace with hash 616622098, now seen corresponding path program 1 times [2019-10-02 13:25:45,021 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:25:45,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:25:45,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:45,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:25:45,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 13:25:45,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:25:45,242 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:25:45,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:25:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:45,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 3098 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:25:45,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:25:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:25:46,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:25:46,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2019-10-02 13:25:46,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:25:46,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:25:46,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:25:46,107 INFO L87 Difference]: Start difference. First operand 27902 states and 44666 transitions. Second operand 13 states. [2019-10-02 13:25:56,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:25:56,762 INFO L93 Difference]: Finished difference Result 70961 states and 113543 transitions. [2019-10-02 13:25:56,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 13:25:56,763 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 316 [2019-10-02 13:25:56,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:25:56,889 INFO L225 Difference]: With dead ends: 70961 [2019-10-02 13:25:56,889 INFO L226 Difference]: Without dead ends: 42145 [2019-10-02 13:25:56,946 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2019-10-02 13:25:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42145 states. [2019-10-02 13:25:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42145 to 41856. [2019-10-02 13:25:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41856 states. [2019-10-02 13:25:59,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41856 states to 41856 states and 67056 transitions. [2019-10-02 13:25:59,280 INFO L78 Accepts]: Start accepts. Automaton has 41856 states and 67056 transitions. Word has length 316 [2019-10-02 13:25:59,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:25:59,281 INFO L475 AbstractCegarLoop]: Abstraction has 41856 states and 67056 transitions. [2019-10-02 13:25:59,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:25:59,281 INFO L276 IsEmpty]: Start isEmpty. Operand 41856 states and 67056 transitions. [2019-10-02 13:25:59,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-10-02 13:25:59,391 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:25:59,392 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:25:59,392 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:25:59,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:25:59,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1327371896, now seen corresponding path program 1 times [2019-10-02 13:25:59,392 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:25:59,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:25:59,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:59,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:25:59,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 13:25:59,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:25:59,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:25:59,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:25:59,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:25:59,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:25:59,711 INFO L87 Difference]: Start difference. First operand 41856 states and 67056 transitions. Second operand 18 states. [2019-10-02 13:26:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:03,712 INFO L93 Difference]: Finished difference Result 42258 states and 67492 transitions. [2019-10-02 13:26:03,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 13:26:03,712 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 319 [2019-10-02 13:26:03,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:03,814 INFO L225 Difference]: With dead ends: 42258 [2019-10-02 13:26:03,815 INFO L226 Difference]: Without dead ends: 41967 [2019-10-02 13:26:03,831 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 13:26:03,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41967 states. [2019-10-02 13:26:05,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41967 to 41856. [2019-10-02 13:26:05,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41856 states. [2019-10-02 13:26:06,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41856 states to 41856 states and 67046 transitions. [2019-10-02 13:26:06,018 INFO L78 Accepts]: Start accepts. Automaton has 41856 states and 67046 transitions. Word has length 319 [2019-10-02 13:26:06,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:06,019 INFO L475 AbstractCegarLoop]: Abstraction has 41856 states and 67046 transitions. [2019-10-02 13:26:06,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:26:06,019 INFO L276 IsEmpty]: Start isEmpty. Operand 41856 states and 67046 transitions. [2019-10-02 13:26:06,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-10-02 13:26:06,131 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:06,131 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:26:06,131 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:06,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:06,132 INFO L82 PathProgramCache]: Analyzing trace with hash -593703868, now seen corresponding path program 1 times [2019-10-02 13:26:06,132 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:06,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:06,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:06,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:06,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-02 13:26:06,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:06,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:26:06,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:26:06,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:26:06,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:26:06,314 INFO L87 Difference]: Start difference. First operand 41856 states and 67046 transitions. Second operand 8 states. [2019-10-02 13:26:08,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:08,282 INFO L93 Difference]: Finished difference Result 42062 states and 67280 transitions. [2019-10-02 13:26:08,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:26:08,283 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 320 [2019-10-02 13:26:08,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:08,392 INFO L225 Difference]: With dead ends: 42062 [2019-10-02 13:26:08,392 INFO L226 Difference]: Without dead ends: 42047 [2019-10-02 13:26:08,412 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:26:08,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42047 states. [2019-10-02 13:26:10,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42047 to 41922. [2019-10-02 13:26:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41922 states. [2019-10-02 13:26:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41922 states to 41922 states and 67126 transitions. [2019-10-02 13:26:10,757 INFO L78 Accepts]: Start accepts. Automaton has 41922 states and 67126 transitions. Word has length 320 [2019-10-02 13:26:10,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:10,757 INFO L475 AbstractCegarLoop]: Abstraction has 41922 states and 67126 transitions. [2019-10-02 13:26:10,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:26:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand 41922 states and 67126 transitions. [2019-10-02 13:26:10,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-10-02 13:26:10,874 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:10,875 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:26:10,875 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:10,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:10,875 INFO L82 PathProgramCache]: Analyzing trace with hash 293799813, now seen corresponding path program 1 times [2019-10-02 13:26:10,875 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:10,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:10,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:10,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:10,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:11,235 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 13:26:11,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:11,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-10-02 13:26:11,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 13:26:11,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 13:26:11,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:26:11,237 INFO L87 Difference]: Start difference. First operand 41922 states and 67126 transitions. Second operand 22 states. [2019-10-02 13:26:14,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:14,105 INFO L93 Difference]: Finished difference Result 41940 states and 67142 transitions. [2019-10-02 13:26:14,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 13:26:14,105 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 320 [2019-10-02 13:26:14,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:14,205 INFO L225 Difference]: With dead ends: 41940 [2019-10-02 13:26:14,205 INFO L226 Difference]: Without dead ends: 40018 [2019-10-02 13:26:14,223 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=1362, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 13:26:14,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40018 states. [2019-10-02 13:26:17,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40018 to 39889. [2019-10-02 13:26:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39889 states. [2019-10-02 13:26:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39889 states to 39889 states and 64672 transitions. [2019-10-02 13:26:17,632 INFO L78 Accepts]: Start accepts. Automaton has 39889 states and 64672 transitions. Word has length 320 [2019-10-02 13:26:17,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:17,633 INFO L475 AbstractCegarLoop]: Abstraction has 39889 states and 64672 transitions. [2019-10-02 13:26:17,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 13:26:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand 39889 states and 64672 transitions. [2019-10-02 13:26:17,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-10-02 13:26:17,768 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:17,768 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:17,768 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:17,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:17,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2065379757, now seen corresponding path program 1 times [2019-10-02 13:26:17,769 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:17,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:17,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:17,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:17,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:17,992 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-02 13:26:17,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:26:17,993 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:26:18,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:18,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 3138 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 13:26:18,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:26:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 13:26:18,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:26:18,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 14 [2019-10-02 13:26:18,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 13:26:18,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 13:26:18,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-10-02 13:26:18,718 INFO L87 Difference]: Start difference. First operand 39889 states and 64672 transitions. Second operand 14 states. [2019-10-02 13:26:20,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:20,560 INFO L93 Difference]: Finished difference Result 43269 states and 68749 transitions. [2019-10-02 13:26:20,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:26:20,561 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 323 [2019-10-02 13:26:20,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:20,663 INFO L225 Difference]: With dead ends: 43269 [2019-10-02 13:26:20,664 INFO L226 Difference]: Without dead ends: 36928 [2019-10-02 13:26:20,684 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:26:20,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36928 states. [2019-10-02 13:26:22,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36928 to 36856. [2019-10-02 13:26:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36856 states. [2019-10-02 13:26:22,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36856 states to 36856 states and 61040 transitions. [2019-10-02 13:26:22,808 INFO L78 Accepts]: Start accepts. Automaton has 36856 states and 61040 transitions. Word has length 323 [2019-10-02 13:26:22,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:22,808 INFO L475 AbstractCegarLoop]: Abstraction has 36856 states and 61040 transitions. [2019-10-02 13:26:22,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 13:26:22,809 INFO L276 IsEmpty]: Start isEmpty. Operand 36856 states and 61040 transitions. [2019-10-02 13:26:22,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-10-02 13:26:22,909 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:22,909 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:26:22,909 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:22,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:22,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1243924208, now seen corresponding path program 1 times [2019-10-02 13:26:22,910 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:22,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:22,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:22,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:22,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-02 13:26:23,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:26:23,126 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:26:23,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:23,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 3170 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 13:26:23,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:26:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-02 13:26:23,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:26:23,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-02 13:26:23,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 13:26:23,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 13:26:23,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-10-02 13:26:23,882 INFO L87 Difference]: Start difference. First operand 36856 states and 61040 transitions. Second operand 15 states. [2019-10-02 13:26:28,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:28,590 INFO L93 Difference]: Finished difference Result 43730 states and 70040 transitions. [2019-10-02 13:26:28,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 13:26:28,595 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 340 [2019-10-02 13:26:28,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:28,678 INFO L225 Difference]: With dead ends: 43730 [2019-10-02 13:26:28,679 INFO L226 Difference]: Without dead ends: 38577 [2019-10-02 13:26:28,692 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2019-10-02 13:26:28,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38577 states. [2019-10-02 13:26:30,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38577 to 38185. [2019-10-02 13:26:30,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38185 states. [2019-10-02 13:26:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38185 states to 38185 states and 63143 transitions. [2019-10-02 13:26:30,473 INFO L78 Accepts]: Start accepts. Automaton has 38185 states and 63143 transitions. Word has length 340 [2019-10-02 13:26:30,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:30,473 INFO L475 AbstractCegarLoop]: Abstraction has 38185 states and 63143 transitions. [2019-10-02 13:26:30,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 13:26:30,474 INFO L276 IsEmpty]: Start isEmpty. Operand 38185 states and 63143 transitions. [2019-10-02 13:26:30,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-10-02 13:26:30,586 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:30,586 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:26:30,586 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:30,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:30,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1993491498, now seen corresponding path program 1 times [2019-10-02 13:26:30,586 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:30,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:30,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:30,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:30,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-02 13:26:30,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:30,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:26:30,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:26:30,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:26:30,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:26:30,720 INFO L87 Difference]: Start difference. First operand 38185 states and 63143 transitions. Second operand 3 states. [2019-10-02 13:26:33,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:33,914 INFO L93 Difference]: Finished difference Result 102194 states and 172747 transitions. [2019-10-02 13:26:33,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:26:33,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-10-02 13:26:33,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:34,060 INFO L225 Difference]: With dead ends: 102194 [2019-10-02 13:26:34,061 INFO L226 Difference]: Without dead ends: 64846 [2019-10-02 13:26:34,112 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 13:26:34,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64846 states. [2019-10-02 13:26:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64846 to 64826. [2019-10-02 13:26:37,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64826 states. [2019-10-02 13:26:37,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64826 states to 64826 states and 109978 transitions. [2019-10-02 13:26:37,778 INFO L78 Accepts]: Start accepts. Automaton has 64826 states and 109978 transitions. Word has length 327 [2019-10-02 13:26:37,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:37,778 INFO L475 AbstractCegarLoop]: Abstraction has 64826 states and 109978 transitions. [2019-10-02 13:26:37,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:26:37,779 INFO L276 IsEmpty]: Start isEmpty. Operand 64826 states and 109978 transitions. [2019-10-02 13:26:38,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-10-02 13:26:38,009 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:38,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:26:38,009 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:38,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:38,010 INFO L82 PathProgramCache]: Analyzing trace with hash 69273740, now seen corresponding path program 1 times [2019-10-02 13:26:38,010 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:38,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:38,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:38,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:38,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-02 13:26:38,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:38,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:26:38,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:26:38,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:26:38,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:26:38,161 INFO L87 Difference]: Start difference. First operand 64826 states and 109978 transitions. Second operand 3 states. [2019-10-02 13:26:44,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:44,956 INFO L93 Difference]: Finished difference Result 177973 states and 305143 transitions. [2019-10-02 13:26:44,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:26:44,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-10-02 13:26:44,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:45,317 INFO L225 Difference]: With dead ends: 177973 [2019-10-02 13:26:45,317 INFO L226 Difference]: Without dead ends: 114205 [2019-10-02 13:26:45,446 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 13:26:45,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114205 states. [2019-10-02 13:26:55,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114205 to 114185. [2019-10-02 13:26:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114185 states. [2019-10-02 13:26:55,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114185 states to 114185 states and 195103 transitions. [2019-10-02 13:26:55,984 INFO L78 Accepts]: Start accepts. Automaton has 114185 states and 195103 transitions. Word has length 328 [2019-10-02 13:26:55,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:55,985 INFO L475 AbstractCegarLoop]: Abstraction has 114185 states and 195103 transitions. [2019-10-02 13:26:55,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:26:55,985 INFO L276 IsEmpty]: Start isEmpty. Operand 114185 states and 195103 transitions. [2019-10-02 13:26:56,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-10-02 13:26:56,493 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:56,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:26:56,493 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:56,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:56,493 INFO L82 PathProgramCache]: Analyzing trace with hash -689285812, now seen corresponding path program 1 times [2019-10-02 13:26:56,494 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:56,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:56,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:56,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:56,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-02 13:26:56,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:56,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:26:56,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:26:56,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:26:56,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:26:56,631 INFO L87 Difference]: Start difference. First operand 114185 states and 195103 transitions. Second operand 3 states. [2019-10-02 13:27:10,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:27:10,730 INFO L93 Difference]: Finished difference Result 327108 states and 562951 transitions. [2019-10-02 13:27:10,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:27:10,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-10-02 13:27:10,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:27:11,428 INFO L225 Difference]: With dead ends: 327108 [2019-10-02 13:27:11,429 INFO L226 Difference]: Without dead ends: 214200 [2019-10-02 13:27:11,665 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 13:27:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214200 states. [2019-10-02 13:27:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214200 to 214180. [2019-10-02 13:27:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214180 states. [2019-10-02 13:27:29,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214180 states to 214180 states and 366547 transitions. [2019-10-02 13:27:29,314 INFO L78 Accepts]: Start accepts. Automaton has 214180 states and 366547 transitions. Word has length 329 [2019-10-02 13:27:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:27:29,315 INFO L475 AbstractCegarLoop]: Abstraction has 214180 states and 366547 transitions. [2019-10-02 13:27:29,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:27:29,315 INFO L276 IsEmpty]: Start isEmpty. Operand 214180 states and 366547 transitions. [2019-10-02 13:27:30,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-10-02 13:27:30,543 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:27:30,543 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:27:30,544 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:27:30,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:27:30,544 INFO L82 PathProgramCache]: Analyzing trace with hash -84916500, now seen corresponding path program 1 times [2019-10-02 13:27:30,544 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:27:30,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:27:30,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:30,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:30,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:31,381 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-02 13:27:31,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:27:31,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:27:31,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:27:31,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:27:31,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:27:31,382 INFO L87 Difference]: Start difference. First operand 214180 states and 366547 transitions. Second operand 3 states. [2019-10-02 13:27:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:27:57,299 INFO L93 Difference]: Finished difference Result 611326 states and 1052167 transitions. [2019-10-02 13:27:57,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:27:57,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-10-02 13:27:57,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:27:58,649 INFO L225 Difference]: With dead ends: 611326 [2019-10-02 13:27:58,649 INFO L226 Difference]: Without dead ends: 398675 [2019-10-02 13:27:59,036 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 13:27:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398675 states. [2019-10-02 13:28:40,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398675 to 398655. [2019-10-02 13:28:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398655 states. [2019-10-02 13:28:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398655 states to 398655 states and 681601 transitions. [2019-10-02 13:28:42,055 INFO L78 Accepts]: Start accepts. Automaton has 398655 states and 681601 transitions. Word has length 330 [2019-10-02 13:28:42,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:28:42,055 INFO L475 AbstractCegarLoop]: Abstraction has 398655 states and 681601 transitions. [2019-10-02 13:28:42,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:28:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 398655 states and 681601 transitions. [2019-10-02 13:28:54,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-10-02 13:28:54,540 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:28:54,542 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:28:54,542 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:28:54,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:28:54,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1080549038, now seen corresponding path program 1 times [2019-10-02 13:28:54,543 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:28:54,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:28:54,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:28:54,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:28:54,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:28:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:28:54,724 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-02 13:28:54,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:28:54,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:28:54,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:28:54,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:28:54,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:28:54,726 INFO L87 Difference]: Start difference. First operand 398655 states and 681601 transitions. Second operand 3 states. [2019-10-02 13:29:51,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:29:51,868 INFO L93 Difference]: Finished difference Result 1145856 states and 1953684 transitions. [2019-10-02 13:29:51,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:29:51,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-10-02 13:29:51,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:29:55,623 INFO L225 Difference]: With dead ends: 1145856 [2019-10-02 13:29:55,623 INFO L226 Difference]: Without dead ends: 749077 [2019-10-02 13:29:56,318 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 13:29:56,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749077 states. [2019-10-02 13:31:16,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749077 to 749057. [2019-10-02 13:31:16,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749057 states. [2019-10-02 13:31:20,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749057 states to 749057 states and 1262434 transitions. [2019-10-02 13:31:20,545 INFO L78 Accepts]: Start accepts. Automaton has 749057 states and 1262434 transitions. Word has length 331 [2019-10-02 13:31:20,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:31:20,546 INFO L475 AbstractCegarLoop]: Abstraction has 749057 states and 1262434 transitions. [2019-10-02 13:31:20,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:31:20,546 INFO L276 IsEmpty]: Start isEmpty. Operand 749057 states and 1262434 transitions. [2019-10-02 13:31:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-10-02 13:31:39,316 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:31:39,317 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:31:39,317 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:31:39,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:31:39,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1065287052, now seen corresponding path program 1 times [2019-10-02 13:31:39,317 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:31:39,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:31:39,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:31:39,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:31:39,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:31:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:31:39,438 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-02 13:31:39,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:31:39,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:31:39,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:31:39,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:31:39,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:31:39,439 INFO L87 Difference]: Start difference. First operand 749057 states and 1262434 transitions. Second operand 3 states. [2019-10-02 13:33:33,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:33:33,336 INFO L93 Difference]: Finished difference Result 1418384 states and 2393480 transitions. [2019-10-02 13:33:33,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:33:33,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-10-02 13:33:33,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:33:37,764 INFO L225 Difference]: With dead ends: 1418384 [2019-10-02 13:33:37,765 INFO L226 Difference]: Without dead ends: 1412290 [2019-10-02 13:33:38,128 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 13:33:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412290 states.