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_product23.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:11:16,543 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:11:16,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:11:16,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:11:16,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:11:16,561 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:11:16,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:11:16,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:11:16,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:11:16,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:11:16,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:11:16,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:11:16,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:11:16,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:11:16,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:11:16,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:11:16,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:11:16,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:11:16,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:11:16,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:11:16,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:11:16,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:11:16,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:11:16,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:11:16,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:11:16,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:11:16,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:11:16,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:11:16,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:11:16,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:11:16,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:11:16,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:11:16,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:11:16,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:11:16,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:11:16,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:11:16,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:11:16,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:11:16,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:11:16,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:11:16,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:11:16,628 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 05:11:16,642 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:11:16,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:11:16,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:11:16,644 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:11:16,644 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:11:16,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:11:16,645 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:11:16,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:11:16,645 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:11:16,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:11:16,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:11:16,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:11:16,646 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:11:16,646 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:11:16,646 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:11:16,647 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:11:16,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:11:16,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:11:16,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:11:16,648 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:11:16,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:11:16,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:11:16,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:11:16,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:11:16,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:11:16,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:11:16,649 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:11:16,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:11:16,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:11:16,702 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:11:16,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:11:16,722 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:11:16,723 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:11:16,724 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:11:16,725 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec4_product23.cil.c [2019-09-08 05:11:16,798 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5543b5d80/02a1d80c9ada41d68e12dbc4d2d44717/FLAG66605db4b [2019-09-08 05:11:17,402 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:11:17,403 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec4_product23.cil.c [2019-09-08 05:11:17,441 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5543b5d80/02a1d80c9ada41d68e12dbc4d2d44717/FLAG66605db4b [2019-09-08 05:11:17,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5543b5d80/02a1d80c9ada41d68e12dbc4d2d44717 [2019-09-08 05:11:17,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:11:17,645 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:11:17,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:11:17,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:11:17,650 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:11:17,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:11:17" (1/1) ... [2019-09-08 05:11:17,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@664351b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:11:17, skipping insertion in model container [2019-09-08 05:11:17,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:11:17" (1/1) ... [2019-09-08 05:11:17,663 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:11:17,748 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:11:18,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:11:18,489 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:11:18,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:11:18,837 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:11:18,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:11:18 WrapperNode [2019-09-08 05:11:18,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:11:18,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:11:18,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:11:18,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:11:18,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:11:18" (1/1) ... [2019-09-08 05:11:18,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:11:18" (1/1) ... [2019-09-08 05:11:18,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:11:18" (1/1) ... [2019-09-08 05:11:18,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:11:18" (1/1) ... [2019-09-08 05:11:18,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:11:18" (1/1) ... [2019-09-08 05:11:19,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:11:18" (1/1) ... [2019-09-08 05:11:19,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:11:18" (1/1) ... [2019-09-08 05:11:19,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:11:19,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:11:19,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:11:19,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:11:19,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:11:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:11:19,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:11:19,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:11:19,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:11:19,134 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:11:19,134 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:11:19,135 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:11:19,135 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:11:19,135 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:11:19,135 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:11:19,136 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:11:19,136 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:11:19,136 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:11:19,136 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:11:19,137 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:11:19,137 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:11:19,137 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:11:19,137 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:11:19,138 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:11:19,138 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:11:19,138 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:11:19,138 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:11:19,139 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:11:19,139 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:11:19,139 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:11:19,139 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:11:19,139 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:11:19,140 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:11:19,140 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:11:19,140 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:11:19,140 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:11:19,140 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:11:19,141 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:11:19,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:11:19,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:11:19,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:11:19,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:11:19,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:11:19,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:11:19,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignForward_spec__1 [2019-09-08 05:11:19,142 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:11:19,142 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-08 05:11:19,142 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-09-08 05:11:19,143 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:11:19,143 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:11:19,143 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:11:19,143 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:11:19,143 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:11:19,143 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:11:19,144 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-08 05:11:19,144 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:11:19,144 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:11:19,144 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Keys [2019-09-08 05:11:19,144 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 05:11:19,145 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:11:19,145 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:11:19,145 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:11:19,145 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:11:19,145 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:11:19,145 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:11:19,146 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:11:19,146 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:11:19,146 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:11:19,146 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 05:11:19,146 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 05:11:19,146 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:11:19,147 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:11:19,147 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:11:19,147 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:11:19,147 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:11:19,147 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:11:19,147 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:11:19,148 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:11:19,148 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:11:19,148 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:11:19,148 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:11:19,148 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:11:19,148 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:11:19,149 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:11:19,149 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:11:19,149 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:11:19,149 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:11:19,149 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:11:19,149 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:11:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:11:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:11:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:11:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:11:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:11:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:11:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:11:19,151 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:11:19,151 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:11:19,151 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:11:19,151 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:11:19,151 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:11:19,151 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:11:19,152 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:11:19,152 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:11:19,152 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:11:19,152 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:11:19,152 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:11:19,152 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:11:19,152 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:11:19,153 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:11:19,153 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:11:19,153 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:11:19,153 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:11:19,153 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 05:11:19,153 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 05:11:19,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:11:19,154 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:11:19,154 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:11:19,154 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:11:19,154 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:11:19,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:11:19,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:11:19,154 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:11:19,155 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:11:19,155 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:11:19,155 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:11:19,155 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:11:19,155 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:11:19,155 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:11:19,156 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:11:19,156 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:11:19,156 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:11:19,156 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:11:19,156 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:11:19,156 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:11:19,156 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:11:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:11:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:11:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:11:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:11:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:11:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:11:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:11:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:11:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:11:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:11:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:11:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:11:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:11:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:11:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:11:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:11:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:11:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:11:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:11:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:11:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:11:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:11:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:11:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:11:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:11:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:11:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:11:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:11:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:11:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:11:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:11:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:11:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:11:19,162 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:11:19,162 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:11:19,162 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignForward_spec__1 [2019-09-08 05:11:19,162 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:11:19,162 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:11:19,162 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:11:19,163 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:11:19,163 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:11:19,163 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:11:19,163 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:11:19,163 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:11:19,163 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:11:19,163 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:11:19,164 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:11:19,164 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:11:19,164 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:11:19,164 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-08 05:11:19,164 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-09-08 05:11:19,164 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:11:19,164 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:11:19,164 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:11:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:11:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:11:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:11:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:11:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:11:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:11:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:11:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:11:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:11:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:11:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:11:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:11:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 05:11:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 05:11:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:11:19,167 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:11:19,167 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:11:19,167 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-08 05:11:19,167 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Keys [2019-09-08 05:11:19,167 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 05:11:19,167 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:11:19,167 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 05:11:19,168 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:11:19,168 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:11:19,168 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:11:19,168 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:11:19,168 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 05:11:19,168 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:11:19,169 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:11:19,169 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:11:19,169 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:11:19,169 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:11:19,169 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:11:19,169 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:11:19,169 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:11:19,170 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:11:19,170 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:11:19,170 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:11:19,170 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:11:19,170 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:11:19,170 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:11:19,170 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:11:19,170 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:11:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:11:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:11:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:11:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:11:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:11:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:11:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:11:19,172 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:11:19,172 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:11:19,172 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:11:19,172 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:11:19,172 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:11:19,172 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:11:19,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:11:19,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:11:19,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:11:21,218 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:11:21,218 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:11:21,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:11:21 BoogieIcfgContainer [2019-09-08 05:11:21,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:11:21,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:11:21,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:11:21,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:11:21,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:11:17" (1/3) ... [2019-09-08 05:11:21,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f75022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:11:21, skipping insertion in model container [2019-09-08 05:11:21,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:11:18" (2/3) ... [2019-09-08 05:11:21,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f75022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:11:21, skipping insertion in model container [2019-09-08 05:11:21,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:11:21" (3/3) ... [2019-09-08 05:11:21,228 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec4_product23.cil.c [2019-09-08 05:11:21,238 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:11:21,247 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:11:21,265 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:11:21,302 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:11:21,302 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:11:21,303 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:11:21,303 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:11:21,303 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:11:21,303 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:11:21,303 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:11:21,303 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:11:21,304 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:11:21,335 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states. [2019-09-08 05:11:21,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 05:11:21,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:11:21,362 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:11:21,371 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:11:21,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:11:21,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1052555921, now seen corresponding path program 1 times [2019-09-08 05:11:21,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:11:21,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:11:21,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:21,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:11:21,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:11:22,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:11:22,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:11:22,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:11:22,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:11:22,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:11:22,074 INFO L87 Difference]: Start difference. First operand 575 states. Second operand 2 states. [2019-09-08 05:11:22,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:11:22,242 INFO L93 Difference]: Finished difference Result 792 states and 1074 transitions. [2019-09-08 05:11:22,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:11:22,244 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 157 [2019-09-08 05:11:22,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:11:22,288 INFO L225 Difference]: With dead ends: 792 [2019-09-08 05:11:22,288 INFO L226 Difference]: Without dead ends: 524 [2019-09-08 05:11:22,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:11:22,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-09-08 05:11:22,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2019-09-08 05:11:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-09-08 05:11:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 716 transitions. [2019-09-08 05:11:22,440 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 716 transitions. Word has length 157 [2019-09-08 05:11:22,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:11:22,442 INFO L475 AbstractCegarLoop]: Abstraction has 524 states and 716 transitions. [2019-09-08 05:11:22,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:11:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 716 transitions. [2019-09-08 05:11:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 05:11:22,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:11:22,449 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:11:22,449 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:11:22,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:11:22,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1340998615, now seen corresponding path program 1 times [2019-09-08 05:11:22,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:11:22,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:11:22,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:22,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:11:22,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:11:22,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:11:22,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:11:22,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:11:22,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:11:22,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:11:22,707 INFO L87 Difference]: Start difference. First operand 524 states and 716 transitions. Second operand 3 states. [2019-09-08 05:11:22,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:11:22,759 INFO L93 Difference]: Finished difference Result 775 states and 1040 transitions. [2019-09-08 05:11:22,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:11:22,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-08 05:11:22,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:11:22,770 INFO L225 Difference]: With dead ends: 775 [2019-09-08 05:11:22,770 INFO L226 Difference]: Without dead ends: 527 [2019-09-08 05:11:22,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:11:22,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-08 05:11:22,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 526. [2019-09-08 05:11:22,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-09-08 05:11:22,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 718 transitions. [2019-09-08 05:11:22,807 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 718 transitions. Word has length 158 [2019-09-08 05:11:22,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:11:22,808 INFO L475 AbstractCegarLoop]: Abstraction has 526 states and 718 transitions. [2019-09-08 05:11:22,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:11:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 718 transitions. [2019-09-08 05:11:22,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 05:11:22,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:11:22,815 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:11:22,815 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:11:22,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:11:22,816 INFO L82 PathProgramCache]: Analyzing trace with hash 919719641, now seen corresponding path program 1 times [2019-09-08 05:11:22,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:11:22,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:11:22,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:22,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:11:22,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:22,974 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:11:22,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:11:22,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:11:22,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:11:22,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:11:22,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:11:22,979 INFO L87 Difference]: Start difference. First operand 526 states and 718 transitions. Second operand 3 states. [2019-09-08 05:11:23,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:11:23,084 INFO L93 Difference]: Finished difference Result 1030 states and 1437 transitions. [2019-09-08 05:11:23,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:11:23,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-08 05:11:23,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:11:23,092 INFO L225 Difference]: With dead ends: 1030 [2019-09-08 05:11:23,092 INFO L226 Difference]: Without dead ends: 569 [2019-09-08 05:11:23,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:11:23,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-09-08 05:11:23,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 568. [2019-09-08 05:11:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-08 05:11:23,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 790 transitions. [2019-09-08 05:11:23,131 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 790 transitions. Word has length 168 [2019-09-08 05:11:23,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:11:23,132 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 790 transitions. [2019-09-08 05:11:23,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:11:23,132 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 790 transitions. [2019-09-08 05:11:23,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 05:11:23,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:11:23,140 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:11:23,141 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:11:23,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:11:23,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1728319775, now seen corresponding path program 1 times [2019-09-08 05:11:23,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:11:23,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:11:23,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:23,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:11:23,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:23,315 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:11:23,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:11:23,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:11:23,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:11:23,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:11:23,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:11:23,318 INFO L87 Difference]: Start difference. First operand 568 states and 790 transitions. Second operand 3 states. [2019-09-08 05:11:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:11:23,359 INFO L93 Difference]: Finished difference Result 1153 states and 1648 transitions. [2019-09-08 05:11:23,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:11:23,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-09-08 05:11:23,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:11:23,365 INFO L225 Difference]: With dead ends: 1153 [2019-09-08 05:11:23,365 INFO L226 Difference]: Without dead ends: 650 [2019-09-08 05:11:23,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:11:23,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-09-08 05:11:23,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 649. [2019-09-08 05:11:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-09-08 05:11:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 928 transitions. [2019-09-08 05:11:23,391 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 928 transitions. Word has length 169 [2019-09-08 05:11:23,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:11:23,392 INFO L475 AbstractCegarLoop]: Abstraction has 649 states and 928 transitions. [2019-09-08 05:11:23,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:11:23,392 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 928 transitions. [2019-09-08 05:11:23,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 05:11:23,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:11:23,397 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:11:23,397 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:11:23,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:11:23,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1843291641, now seen corresponding path program 1 times [2019-09-08 05:11:23,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:11:23,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:11:23,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:23,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:11:23,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:23,537 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:11:23,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:11:23,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:11:23,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:11:23,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:11:23,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:11:23,539 INFO L87 Difference]: Start difference. First operand 649 states and 928 transitions. Second operand 3 states. [2019-09-08 05:11:23,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:11:23,575 INFO L93 Difference]: Finished difference Result 1390 states and 2052 transitions. [2019-09-08 05:11:23,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:11:23,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-08 05:11:23,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:11:23,581 INFO L225 Difference]: With dead ends: 1390 [2019-09-08 05:11:23,582 INFO L226 Difference]: Without dead ends: 806 [2019-09-08 05:11:23,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:11:23,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-09-08 05:11:23,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 805. [2019-09-08 05:11:23,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-09-08 05:11:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1192 transitions. [2019-09-08 05:11:23,618 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1192 transitions. Word has length 170 [2019-09-08 05:11:23,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:11:23,619 INFO L475 AbstractCegarLoop]: Abstraction has 805 states and 1192 transitions. [2019-09-08 05:11:23,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:11:23,620 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1192 transitions. [2019-09-08 05:11:23,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 05:11:23,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:11:23,628 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:11:23,629 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:11:23,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:11:23,629 INFO L82 PathProgramCache]: Analyzing trace with hash 446108159, now seen corresponding path program 1 times [2019-09-08 05:11:23,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:11:23,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:11:23,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:23,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:11:23,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:11:23,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:11:23,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:11:23,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:11:23,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:11:23,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:11:23,926 INFO L87 Difference]: Start difference. First operand 805 states and 1192 transitions. Second operand 3 states. [2019-09-08 05:11:23,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:11:23,987 INFO L93 Difference]: Finished difference Result 1846 states and 2824 transitions. [2019-09-08 05:11:23,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:11:23,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-08 05:11:23,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:11:23,998 INFO L225 Difference]: With dead ends: 1846 [2019-09-08 05:11:23,998 INFO L226 Difference]: Without dead ends: 1106 [2019-09-08 05:11:24,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:11:24,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-08 05:11:24,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1105. [2019-09-08 05:11:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1105 states. [2019-09-08 05:11:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1696 transitions. [2019-09-08 05:11:24,060 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1696 transitions. Word has length 171 [2019-09-08 05:11:24,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:11:24,061 INFO L475 AbstractCegarLoop]: Abstraction has 1105 states and 1696 transitions. [2019-09-08 05:11:24,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:11:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1696 transitions. [2019-09-08 05:11:24,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 05:11:24,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:11:24,071 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:11:24,071 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:11:24,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:11:24,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2000282625, now seen corresponding path program 1 times [2019-09-08 05:11:24,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:11:24,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:11:24,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:24,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:11:24,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:11:24,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:11:24,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:11:24,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:11:24,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:11:24,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:11:24,292 INFO L87 Difference]: Start difference. First operand 1105 states and 1696 transitions. Second operand 7 states. [2019-09-08 05:11:27,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:11:27,299 INFO L93 Difference]: Finished difference Result 1593 states and 2336 transitions. [2019-09-08 05:11:27,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:11:27,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 174 [2019-09-08 05:11:27,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:11:27,308 INFO L225 Difference]: With dead ends: 1593 [2019-09-08 05:11:27,308 INFO L226 Difference]: Without dead ends: 1356 [2019-09-08 05:11:27,310 INFO L628 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-09-08 05:11:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2019-09-08 05:11:27,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1347. [2019-09-08 05:11:27,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-09-08 05:11:27,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 2013 transitions. [2019-09-08 05:11:27,400 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 2013 transitions. Word has length 174 [2019-09-08 05:11:27,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:11:27,402 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 2013 transitions. [2019-09-08 05:11:27,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:11:27,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 2013 transitions. [2019-09-08 05:11:27,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 05:11:27,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:11:27,409 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:11:27,409 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:11:27,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:11:27,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1175251605, now seen corresponding path program 1 times [2019-09-08 05:11:27,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:11:27,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:11:27,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:27,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:11:27,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:27,738 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:11:27,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:11:27,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:11:27,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:11:27,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:11:27,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:11:27,740 INFO L87 Difference]: Start difference. First operand 1347 states and 2013 transitions. Second operand 18 states. [2019-09-08 05:11:28,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:11:28,200 INFO L93 Difference]: Finished difference Result 1920 states and 2781 transitions. [2019-09-08 05:11:28,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:11:28,201 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 175 [2019-09-08 05:11:28,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:11:28,210 INFO L225 Difference]: With dead ends: 1920 [2019-09-08 05:11:28,210 INFO L226 Difference]: Without dead ends: 1435 [2019-09-08 05:11:28,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:11:28,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2019-09-08 05:11:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1433. [2019-09-08 05:11:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2019-09-08 05:11:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2132 transitions. [2019-09-08 05:11:28,317 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2132 transitions. Word has length 175 [2019-09-08 05:11:28,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:11:28,317 INFO L475 AbstractCegarLoop]: Abstraction has 1433 states and 2132 transitions. [2019-09-08 05:11:28,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:11:28,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2132 transitions. [2019-09-08 05:11:28,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 05:11:28,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:11:28,324 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:11:28,325 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:11:28,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:11:28,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2007814747, now seen corresponding path program 1 times [2019-09-08 05:11:28,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:11:28,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:11:28,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:28,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:11:28,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:11:28,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:11:28,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:11:28,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:11:28,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:11:28,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:11:28,506 INFO L87 Difference]: Start difference. First operand 1433 states and 2132 transitions. Second operand 8 states. [2019-09-08 05:11:29,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:11:29,426 INFO L93 Difference]: Finished difference Result 2436 states and 3467 transitions. [2019-09-08 05:11:29,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:11:29,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 184 [2019-09-08 05:11:29,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:11:29,443 INFO L225 Difference]: With dead ends: 2436 [2019-09-08 05:11:29,443 INFO L226 Difference]: Without dead ends: 2043 [2019-09-08 05:11:29,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:11:29,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2019-09-08 05:11:29,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2024. [2019-09-08 05:11:29,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2024 states. [2019-09-08 05:11:29,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2922 transitions. [2019-09-08 05:11:29,556 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2922 transitions. Word has length 184 [2019-09-08 05:11:29,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:11:29,556 INFO L475 AbstractCegarLoop]: Abstraction has 2024 states and 2922 transitions. [2019-09-08 05:11:29,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:11:29,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2922 transitions. [2019-09-08 05:11:29,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 05:11:29,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:11:29,564 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:11:29,564 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:11:29,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:11:29,565 INFO L82 PathProgramCache]: Analyzing trace with hash -202279434, now seen corresponding path program 1 times [2019-09-08 05:11:29,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:11:29,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:11:29,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:29,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:11:29,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:29,862 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 05:11:29,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:11:29,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 05:11:29,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 05:11:29,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 05:11:29,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:11:29,864 INFO L87 Difference]: Start difference. First operand 2024 states and 2922 transitions. Second operand 17 states. [2019-09-08 05:11:30,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:11:30,710 INFO L93 Difference]: Finished difference Result 2579 states and 3658 transitions. [2019-09-08 05:11:30,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 05:11:30,712 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 185 [2019-09-08 05:11:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:11:30,724 INFO L225 Difference]: With dead ends: 2579 [2019-09-08 05:11:30,725 INFO L226 Difference]: Without dead ends: 2023 [2019-09-08 05:11:30,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2019-09-08 05:11:30,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2019-09-08 05:11:30,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 2022. [2019-09-08 05:11:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2019-09-08 05:11:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2917 transitions. [2019-09-08 05:11:30,828 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2917 transitions. Word has length 185 [2019-09-08 05:11:30,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:11:30,829 INFO L475 AbstractCegarLoop]: Abstraction has 2022 states and 2917 transitions. [2019-09-08 05:11:30,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 05:11:30,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2917 transitions. [2019-09-08 05:11:30,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 05:11:30,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:11:30,837 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:11:30,837 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:11:30,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:11:30,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1555104262, now seen corresponding path program 2 times [2019-09-08 05:11:30,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:11:30,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:11:30,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:30,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:11:30,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 05:11:31,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:11:31,016 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:11:31,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:11:31,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-08 05:11:31,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:11:31,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 2120 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 05:11:31,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:11:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 05:11:31,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:11:31,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2019-09-08 05:11:31,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 05:11:31,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 05:11:31,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:11:31,620 INFO L87 Difference]: Start difference. First operand 2022 states and 2917 transitions. Second operand 17 states. [2019-09-08 05:11:33,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:11:33,666 INFO L93 Difference]: Finished difference Result 4846 states and 6948 transitions. [2019-09-08 05:11:33,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 05:11:33,667 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 185 [2019-09-08 05:11:33,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:11:33,698 INFO L225 Difference]: With dead ends: 4846 [2019-09-08 05:11:33,699 INFO L226 Difference]: Without dead ends: 3850 [2019-09-08 05:11:33,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=1523, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 05:11:33,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2019-09-08 05:11:33,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3825. [2019-09-08 05:11:33,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3825 states. [2019-09-08 05:11:33,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3825 states to 3825 states and 5594 transitions. [2019-09-08 05:11:33,913 INFO L78 Accepts]: Start accepts. Automaton has 3825 states and 5594 transitions. Word has length 185 [2019-09-08 05:11:33,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:11:33,913 INFO L475 AbstractCegarLoop]: Abstraction has 3825 states and 5594 transitions. [2019-09-08 05:11:33,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 05:11:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3825 states and 5594 transitions. [2019-09-08 05:11:33,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-09-08 05:11:33,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:11:33,935 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:11:33,935 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:11:33,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:11:33,936 INFO L82 PathProgramCache]: Analyzing trace with hash -678556981, now seen corresponding path program 1 times [2019-09-08 05:11:33,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:11:33,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:11:33,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:33,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:11:33,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 05:11:34,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:11:34,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:11:34,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:11:34,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:11:34,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:11:34,269 INFO L87 Difference]: Start difference. First operand 3825 states and 5594 transitions. Second operand 8 states. [2019-09-08 05:11:34,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:11:34,416 INFO L93 Difference]: Finished difference Result 5870 states and 8332 transitions. [2019-09-08 05:11:34,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:11:34,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 291 [2019-09-08 05:11:34,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:11:34,442 INFO L225 Difference]: With dead ends: 5870 [2019-09-08 05:11:34,443 INFO L226 Difference]: Without dead ends: 3825 [2019-09-08 05:11:34,451 INFO L628 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-09-08 05:11:34,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3825 states. [2019-09-08 05:11:34,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3825 to 3825. [2019-09-08 05:11:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3825 states. [2019-09-08 05:11:34,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3825 states to 3825 states and 5586 transitions. [2019-09-08 05:11:34,630 INFO L78 Accepts]: Start accepts. Automaton has 3825 states and 5586 transitions. Word has length 291 [2019-09-08 05:11:34,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:11:34,631 INFO L475 AbstractCegarLoop]: Abstraction has 3825 states and 5586 transitions. [2019-09-08 05:11:34,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:11:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 3825 states and 5586 transitions. [2019-09-08 05:11:34,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-08 05:11:34,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:11:34,653 INFO L399 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:11:34,653 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:11:34,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:11:34,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1293680231, now seen corresponding path program 1 times [2019-09-08 05:11:34,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:11:34,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:11:34,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:34,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:11:34,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-08 05:11:34,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:11:34,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 05:11:34,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:11:34,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:11:34,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:11:34,930 INFO L87 Difference]: Start difference. First operand 3825 states and 5586 transitions. Second operand 13 states. [2019-09-08 05:11:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:11:38,241 INFO L93 Difference]: Finished difference Result 9729 states and 14045 transitions. [2019-09-08 05:11:38,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 05:11:38,242 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 297 [2019-09-08 05:11:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:11:38,296 INFO L225 Difference]: With dead ends: 9729 [2019-09-08 05:11:38,296 INFO L226 Difference]: Without dead ends: 7684 [2019-09-08 05:11:38,309 INFO L628 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-09-08 05:11:38,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7684 states. [2019-09-08 05:11:38,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7684 to 7641. [2019-09-08 05:11:38,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7641 states. [2019-09-08 05:11:38,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7641 states to 7641 states and 11169 transitions. [2019-09-08 05:11:38,709 INFO L78 Accepts]: Start accepts. Automaton has 7641 states and 11169 transitions. Word has length 297 [2019-09-08 05:11:38,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:11:38,710 INFO L475 AbstractCegarLoop]: Abstraction has 7641 states and 11169 transitions. [2019-09-08 05:11:38,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:11:38,710 INFO L276 IsEmpty]: Start isEmpty. Operand 7641 states and 11169 transitions. [2019-09-08 05:11:38,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-09-08 05:11:38,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:11:38,754 INFO L399 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:11:38,754 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:11:38,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:11:38,755 INFO L82 PathProgramCache]: Analyzing trace with hash 2113513535, now seen corresponding path program 1 times [2019-09-08 05:11:38,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:11:38,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:11:38,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:38,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:11:38,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-08 05:11:39,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:11:39,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:11:39,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:11:39,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:11:39,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:11:39,080 INFO L87 Difference]: Start difference. First operand 7641 states and 11169 transitions. Second operand 3 states. [2019-09-08 05:11:39,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:11:39,403 INFO L93 Difference]: Finished difference Result 17516 states and 26257 transitions. [2019-09-08 05:11:39,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:11:39,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 295 [2019-09-08 05:11:39,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:11:39,492 INFO L225 Difference]: With dead ends: 17516 [2019-09-08 05:11:39,492 INFO L226 Difference]: Without dead ends: 9949 [2019-09-08 05:11:39,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:11:39,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9949 states. [2019-09-08 05:11:39,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9949 to 9945. [2019-09-08 05:11:39,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9945 states. [2019-09-08 05:11:40,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9945 states to 9945 states and 15105 transitions. [2019-09-08 05:11:40,025 INFO L78 Accepts]: Start accepts. Automaton has 9945 states and 15105 transitions. Word has length 295 [2019-09-08 05:11:40,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:11:40,025 INFO L475 AbstractCegarLoop]: Abstraction has 9945 states and 15105 transitions. [2019-09-08 05:11:40,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:11:40,026 INFO L276 IsEmpty]: Start isEmpty. Operand 9945 states and 15105 transitions. [2019-09-08 05:11:40,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-08 05:11:40,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:11:40,082 INFO L399 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, 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] [2019-09-08 05:11:40,082 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:11:40,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:11:40,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1747701484, now seen corresponding path program 1 times [2019-09-08 05:11:40,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:11:40,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:11:40,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:40,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:11:40,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:40,424 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-08 05:11:40,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:11:40,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:11:40,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:11:40,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:11:40,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:11:40,426 INFO L87 Difference]: Start difference. First operand 9945 states and 15105 transitions. Second operand 11 states. [2019-09-08 05:11:44,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:11:44,954 INFO L93 Difference]: Finished difference Result 16356 states and 23483 transitions. [2019-09-08 05:11:44,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:11:44,954 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 298 [2019-09-08 05:11:44,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:11:45,005 INFO L225 Difference]: With dead ends: 16356 [2019-09-08 05:11:45,005 INFO L226 Difference]: Without dead ends: 12381 [2019-09-08 05:11:45,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:11:45,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12381 states. [2019-09-08 05:11:45,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12381 to 12189. [2019-09-08 05:11:45,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12189 states. [2019-09-08 05:11:45,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12189 states to 12189 states and 18053 transitions. [2019-09-08 05:11:45,587 INFO L78 Accepts]: Start accepts. Automaton has 12189 states and 18053 transitions. Word has length 298 [2019-09-08 05:11:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:11:45,587 INFO L475 AbstractCegarLoop]: Abstraction has 12189 states and 18053 transitions. [2019-09-08 05:11:45,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:11:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 12189 states and 18053 transitions. [2019-09-08 05:11:45,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 05:11:45,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:11:45,630 INFO L399 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, 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-09-08 05:11:45,630 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:11:45,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:11:45,631 INFO L82 PathProgramCache]: Analyzing trace with hash 949240528, now seen corresponding path program 1 times [2019-09-08 05:11:45,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:11:45,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:11:45,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:45,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:11:45,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:47,042 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-08 05:11:47,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:11:47,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:11:47,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:11:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:47,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 3377 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:11:47,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:11:47,928 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-08 05:11:47,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:11:47,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [37] total 44 [2019-09-08 05:11:47,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-08 05:11:47,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-08 05:11:47,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1801, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 05:11:47,949 INFO L87 Difference]: Start difference. First operand 12189 states and 18053 transitions. Second operand 44 states. [2019-09-08 05:11:56,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:11:56,187 INFO L93 Difference]: Finished difference Result 24434 states and 36146 transitions. [2019-09-08 05:11:56,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-08 05:11:56,188 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 316 [2019-09-08 05:11:56,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:11:56,229 INFO L225 Difference]: With dead ends: 24434 [2019-09-08 05:11:56,229 INFO L226 Difference]: Without dead ends: 11797 [2019-09-08 05:11:56,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1164 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=420, Invalid=8322, Unknown=0, NotChecked=0, Total=8742 [2019-09-08 05:11:56,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11797 states. [2019-09-08 05:11:56,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11797 to 11771. [2019-09-08 05:11:56,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11771 states. [2019-09-08 05:11:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11771 states to 11771 states and 17374 transitions. [2019-09-08 05:11:56,884 INFO L78 Accepts]: Start accepts. Automaton has 11771 states and 17374 transitions. Word has length 316 [2019-09-08 05:11:56,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:11:56,885 INFO L475 AbstractCegarLoop]: Abstraction has 11771 states and 17374 transitions. [2019-09-08 05:11:56,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-08 05:11:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 11771 states and 17374 transitions. [2019-09-08 05:11:56,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 05:11:56,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:11:56,941 INFO L399 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, 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-09-08 05:11:56,942 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:11:56,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:11:56,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1475381118, now seen corresponding path program 1 times [2019-09-08 05:11:56,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:11:56,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:11:56,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:56,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:11:56,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-08 05:11:57,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:11:57,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:11:57,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:11:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:57,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 3420 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:11:57,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:11:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-08 05:11:58,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:11:58,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-08 05:11:58,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 05:11:58,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 05:11:58,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:11:58,011 INFO L87 Difference]: Start difference. First operand 11771 states and 17374 transitions. Second operand 12 states. [2019-09-08 05:12:01,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:12:01,923 INFO L93 Difference]: Finished difference Result 26403 states and 39655 transitions. [2019-09-08 05:12:01,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 05:12:01,924 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 326 [2019-09-08 05:12:01,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:12:01,986 INFO L225 Difference]: With dead ends: 26403 [2019-09-08 05:12:01,987 INFO L226 Difference]: Without dead ends: 14651 [2019-09-08 05:12:02,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2019-09-08 05:12:02,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14651 states. [2019-09-08 05:12:02,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14651 to 14592. [2019-09-08 05:12:02,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14592 states. [2019-09-08 05:12:02,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14592 states to 14592 states and 22092 transitions. [2019-09-08 05:12:02,928 INFO L78 Accepts]: Start accepts. Automaton has 14592 states and 22092 transitions. Word has length 326 [2019-09-08 05:12:02,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:12:02,928 INFO L475 AbstractCegarLoop]: Abstraction has 14592 states and 22092 transitions. [2019-09-08 05:12:02,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 05:12:02,929 INFO L276 IsEmpty]: Start isEmpty. Operand 14592 states and 22092 transitions. [2019-09-08 05:12:02,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 05:12:02,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:12:02,984 INFO L399 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, 1, 1, 1, 1, 1] [2019-09-08 05:12:02,985 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:12:02,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:12:02,985 INFO L82 PathProgramCache]: Analyzing trace with hash -224566306, now seen corresponding path program 1 times [2019-09-08 05:12:02,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:12:02,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:12:02,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:02,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:12:02,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:12:03,372 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 05:12:03,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:12:03,373 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:12:03,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:12:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:12:03,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 3422 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:12:03,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:12:04,217 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Stream closed [2019-09-08 05:12:04,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:12:04,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-09-08 05:12:04,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 05:12:04,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 05:12:04,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:12:04,240 INFO L87 Difference]: Start difference. First operand 14592 states and 22092 transitions. Second operand 25 states. [2019-09-08 05:12:10,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:12:10,201 INFO L93 Difference]: Finished difference Result 31099 states and 46753 transitions. [2019-09-08 05:12:10,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 05:12:10,203 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 328 [2019-09-08 05:12:10,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:12:10,264 INFO L225 Difference]: With dead ends: 31099 [2019-09-08 05:12:10,264 INFO L226 Difference]: Without dead ends: 16169 [2019-09-08 05:12:10,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=246, Invalid=2834, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 05:12:10,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16169 states. [2019-09-08 05:12:11,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16169 to 16070. [2019-09-08 05:12:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16070 states. [2019-09-08 05:12:11,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16070 states to 16070 states and 24063 transitions. [2019-09-08 05:12:11,956 INFO L78 Accepts]: Start accepts. Automaton has 16070 states and 24063 transitions. Word has length 328 [2019-09-08 05:12:11,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:12:11,957 INFO L475 AbstractCegarLoop]: Abstraction has 16070 states and 24063 transitions. [2019-09-08 05:12:11,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 05:12:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 16070 states and 24063 transitions. [2019-09-08 05:12:12,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 05:12:12,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:12:12,006 INFO L399 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, 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-09-08 05:12:12,006 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:12:12,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:12:12,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1964193505, now seen corresponding path program 1 times [2019-09-08 05:12:12,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:12:12,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:12:12,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:12,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:12:12,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:12:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-08 05:12:12,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:12:12,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:12:12,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:12:12,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:12:12,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:12:12,222 INFO L87 Difference]: Start difference. First operand 16070 states and 24063 transitions. Second operand 8 states. [2019-09-08 05:12:19,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:12:19,097 INFO L93 Difference]: Finished difference Result 41899 states and 61350 transitions. [2019-09-08 05:12:19,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 05:12:19,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 330 [2019-09-08 05:12:19,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:12:19,304 INFO L225 Difference]: With dead ends: 41899 [2019-09-08 05:12:19,304 INFO L226 Difference]: Without dead ends: 37150 [2019-09-08 05:12:19,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:12:19,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37150 states. [2019-09-08 05:12:21,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37150 to 36856. [2019-09-08 05:12:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36856 states. [2019-09-08 05:12:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36856 states to 36856 states and 54611 transitions. [2019-09-08 05:12:21,569 INFO L78 Accepts]: Start accepts. Automaton has 36856 states and 54611 transitions. Word has length 330 [2019-09-08 05:12:21,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:12:21,570 INFO L475 AbstractCegarLoop]: Abstraction has 36856 states and 54611 transitions. [2019-09-08 05:12:21,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:12:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 36856 states and 54611 transitions. [2019-09-08 05:12:21,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 05:12:21,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:12:21,672 INFO L399 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:12:21,673 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:12:21,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:12:21,673 INFO L82 PathProgramCache]: Analyzing trace with hash 940963252, now seen corresponding path program 1 times [2019-09-08 05:12:21,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:12:21,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:12:21,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:21,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:12:21,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:12:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-08 05:12:21,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:12:21,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:12:21,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:12:21,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:12:21,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:12:21,886 INFO L87 Difference]: Start difference. First operand 36856 states and 54611 transitions. Second operand 8 states. [2019-09-08 05:12:30,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:12:30,588 INFO L93 Difference]: Finished difference Result 99335 states and 143954 transitions. [2019-09-08 05:12:30,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 05:12:30,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 331 [2019-09-08 05:12:30,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:12:30,858 INFO L225 Difference]: With dead ends: 99335 [2019-09-08 05:12:30,858 INFO L226 Difference]: Without dead ends: 86730 [2019-09-08 05:12:30,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:12:30,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86730 states. [2019-09-08 05:12:34,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86730 to 86204. [2019-09-08 05:12:34,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86204 states. [2019-09-08 05:12:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86204 states to 86204 states and 126383 transitions. [2019-09-08 05:12:36,913 INFO L78 Accepts]: Start accepts. Automaton has 86204 states and 126383 transitions. Word has length 331 [2019-09-08 05:12:36,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:12:36,914 INFO L475 AbstractCegarLoop]: Abstraction has 86204 states and 126383 transitions. [2019-09-08 05:12:36,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:12:36,914 INFO L276 IsEmpty]: Start isEmpty. Operand 86204 states and 126383 transitions. [2019-09-08 05:12:37,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2019-09-08 05:12:37,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:12:37,077 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:12:37,078 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:12:37,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:12:37,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1255198531, now seen corresponding path program 1 times [2019-09-08 05:12:37,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:12:37,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:12:37,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:37,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:12:37,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:12:37,338 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2019-09-08 05:12:37,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:12:37,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:12:37,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:12:37,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:12:37,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:12:37,341 INFO L87 Difference]: Start difference. First operand 86204 states and 126383 transitions. Second operand 6 states. [2019-09-08 05:12:38,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:12:38,419 INFO L93 Difference]: Finished difference Result 115319 states and 168413 transitions. [2019-09-08 05:12:38,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:12:38,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 463 [2019-09-08 05:12:38,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:12:38,528 INFO L225 Difference]: With dead ends: 115319 [2019-09-08 05:12:38,528 INFO L226 Difference]: Without dead ends: 29264 [2019-09-08 05:12:38,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:12:38,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29264 states. [2019-09-08 05:12:40,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29264 to 29241. [2019-09-08 05:12:40,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29241 states. [2019-09-08 05:12:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29241 states to 29241 states and 41987 transitions. [2019-09-08 05:12:40,386 INFO L78 Accepts]: Start accepts. Automaton has 29241 states and 41987 transitions. Word has length 463 [2019-09-08 05:12:40,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:12:40,387 INFO L475 AbstractCegarLoop]: Abstraction has 29241 states and 41987 transitions. [2019-09-08 05:12:40,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:12:40,387 INFO L276 IsEmpty]: Start isEmpty. Operand 29241 states and 41987 transitions. [2019-09-08 05:12:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 05:12:40,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:12:40,438 INFO L399 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:12:40,439 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:12:40,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:12:40,439 INFO L82 PathProgramCache]: Analyzing trace with hash -962496843, now seen corresponding path program 1 times [2019-09-08 05:12:40,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:12:40,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:12:40,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:40,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:12:40,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:12:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-08 05:12:40,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:12:40,742 INFO L223 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-09-08 05:12:40,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:12:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:12:41,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 3424 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:12:41,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:12:41,477 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 05:12:41,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:12:41,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-09-08 05:12:41,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 05:12:41,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 05:12:41,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:12:41,486 INFO L87 Difference]: Start difference. First operand 29241 states and 41987 transitions. Second operand 25 states. [2019-09-08 05:12:47,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:12:47,735 INFO L93 Difference]: Finished difference Result 60241 states and 86206 transitions. [2019-09-08 05:12:47,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 05:12:47,739 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 331 [2019-09-08 05:12:47,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:12:47,815 INFO L225 Difference]: With dead ends: 60241 [2019-09-08 05:12:47,815 INFO L226 Difference]: Without dead ends: 30848 [2019-09-08 05:12:47,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=249, Invalid=2831, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 05:12:47,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30848 states. [2019-09-08 05:12:48,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30848 to 30505. [2019-09-08 05:12:48,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30505 states. [2019-09-08 05:12:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30505 states to 30505 states and 43569 transitions. [2019-09-08 05:12:48,906 INFO L78 Accepts]: Start accepts. Automaton has 30505 states and 43569 transitions. Word has length 331 [2019-09-08 05:12:48,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:12:48,906 INFO L475 AbstractCegarLoop]: Abstraction has 30505 states and 43569 transitions. [2019-09-08 05:12:48,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 05:12:48,907 INFO L276 IsEmpty]: Start isEmpty. Operand 30505 states and 43569 transitions. [2019-09-08 05:12:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 05:12:48,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:12:48,958 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:12:48,958 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:12:48,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:12:48,959 INFO L82 PathProgramCache]: Analyzing trace with hash 220993609, now seen corresponding path program 1 times [2019-09-08 05:12:48,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:12:48,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:12:48,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:48,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:12:48,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:12:49,282 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-08 05:12:49,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:12:49,282 INFO L223 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) [2019-09-08 05:12:49,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:12:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:12:50,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 3426 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:12:50,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:12:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 05:12:50,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:12:50,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2019-09-08 05:12:50,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 05:12:50,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 05:12:50,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:12:50,309 INFO L87 Difference]: Start difference. First operand 30505 states and 43569 transitions. Second operand 23 states. [2019-09-08 05:12:54,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:12:54,336 INFO L93 Difference]: Finished difference Result 43778 states and 61952 transitions. [2019-09-08 05:12:54,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 05:12:54,337 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 333 [2019-09-08 05:12:54,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:12:54,372 INFO L225 Difference]: With dead ends: 43778 [2019-09-08 05:12:54,372 INFO L226 Difference]: Without dead ends: 15474 [2019-09-08 05:12:54,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=229, Invalid=2423, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 05:12:54,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15474 states. [2019-09-08 05:12:54,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15474 to 15258. [2019-09-08 05:12:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15258 states. [2019-09-08 05:12:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15258 states to 15258 states and 22211 transitions. [2019-09-08 05:12:54,954 INFO L78 Accepts]: Start accepts. Automaton has 15258 states and 22211 transitions. Word has length 333 [2019-09-08 05:12:54,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:12:54,955 INFO L475 AbstractCegarLoop]: Abstraction has 15258 states and 22211 transitions. [2019-09-08 05:12:54,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 05:12:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 15258 states and 22211 transitions. [2019-09-08 05:12:54,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 05:12:54,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:12:54,985 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:12:54,985 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:12:54,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:12:54,985 INFO L82 PathProgramCache]: Analyzing trace with hash 169639555, now seen corresponding path program 1 times [2019-09-08 05:12:54,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:12:54,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:12:54,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:54,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:12:54,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:12:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 05:12:55,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:12:55,201 INFO L223 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-09-08 05:12:55,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:12:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:12:55,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 3426 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:12:56,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:12:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:12:56,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:12:56,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2019-09-08 05:12:56,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 05:12:56,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 05:12:56,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:12:56,177 INFO L87 Difference]: Start difference. First operand 15258 states and 22211 transitions. Second operand 17 states. [2019-09-08 05:13:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:13:00,294 INFO L93 Difference]: Finished difference Result 30462 states and 44536 transitions. [2019-09-08 05:13:00,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 05:13:00,294 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 334 [2019-09-08 05:13:00,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:13:00,335 INFO L225 Difference]: With dead ends: 30462 [2019-09-08 05:13:00,335 INFO L226 Difference]: Without dead ends: 15326 [2019-09-08 05:13:00,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 05:13:00,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15326 states. [2019-09-08 05:13:00,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15326 to 15280. [2019-09-08 05:13:00,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15280 states. [2019-09-08 05:13:00,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15280 states to 15280 states and 22204 transitions. [2019-09-08 05:13:00,911 INFO L78 Accepts]: Start accepts. Automaton has 15280 states and 22204 transitions. Word has length 334 [2019-09-08 05:13:00,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:13:00,912 INFO L475 AbstractCegarLoop]: Abstraction has 15280 states and 22204 transitions. [2019-09-08 05:13:00,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 05:13:00,912 INFO L276 IsEmpty]: Start isEmpty. Operand 15280 states and 22204 transitions. [2019-09-08 05:13:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 05:13:00,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:13:00,940 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:13:00,940 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:13:00,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:13:00,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1663653335, now seen corresponding path program 1 times [2019-09-08 05:13:00,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:13:00,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:13:00,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:00,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:13:00,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:13:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-08 05:13:01,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:13:01,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:13:01,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:13:01,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:13:01,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:13:01,276 INFO L87 Difference]: Start difference. First operand 15280 states and 22204 transitions. Second operand 18 states. [2019-09-08 05:13:03,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:13:03,550 INFO L93 Difference]: Finished difference Result 17715 states and 25351 transitions. [2019-09-08 05:13:03,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 05:13:03,550 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 333 [2019-09-08 05:13:03,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:13:03,581 INFO L225 Difference]: With dead ends: 17715 [2019-09-08 05:13:03,581 INFO L226 Difference]: Without dead ends: 15445 [2019-09-08 05:13:03,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=1078, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 05:13:03,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15445 states. [2019-09-08 05:13:04,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15445 to 15280. [2019-09-08 05:13:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15280 states. [2019-09-08 05:13:04,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15280 states to 15280 states and 22194 transitions. [2019-09-08 05:13:04,111 INFO L78 Accepts]: Start accepts. Automaton has 15280 states and 22194 transitions. Word has length 333 [2019-09-08 05:13:04,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:13:04,111 INFO L475 AbstractCegarLoop]: Abstraction has 15280 states and 22194 transitions. [2019-09-08 05:13:04,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:13:04,111 INFO L276 IsEmpty]: Start isEmpty. Operand 15280 states and 22194 transitions. [2019-09-08 05:13:04,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-09-08 05:13:04,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:13:04,138 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:13:04,138 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:13:04,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:13:04,138 INFO L82 PathProgramCache]: Analyzing trace with hash 69605679, now seen corresponding path program 1 times [2019-09-08 05:13:04,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:13:04,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:13:04,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:04,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:13:04,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:13:04,318 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 29 proven. 8 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2019-09-08 05:13:04,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:13:04,318 INFO L223 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-09-08 05:13:04,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:13:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:13:04,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 3918 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:13:04,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:13:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2019-09-08 05:13:05,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:13:05,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-08 05:13:05,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 05:13:05,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 05:13:05,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:13:05,116 INFO L87 Difference]: Start difference. First operand 15280 states and 22194 transitions. Second operand 12 states. [2019-09-08 05:13:06,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:13:06,372 INFO L93 Difference]: Finished difference Result 26755 states and 38224 transitions. [2019-09-08 05:13:06,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:13:06,372 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 447 [2019-09-08 05:13:06,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:13:06,406 INFO L225 Difference]: With dead ends: 26755 [2019-09-08 05:13:06,406 INFO L226 Difference]: Without dead ends: 11558 [2019-09-08 05:13:06,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 445 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-09-08 05:13:06,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11558 states. [2019-09-08 05:13:06,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11558 to 11548. [2019-09-08 05:13:06,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11548 states. [2019-09-08 05:13:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11548 states to 11548 states and 16107 transitions. [2019-09-08 05:13:06,995 INFO L78 Accepts]: Start accepts. Automaton has 11548 states and 16107 transitions. Word has length 447 [2019-09-08 05:13:06,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:13:06,995 INFO L475 AbstractCegarLoop]: Abstraction has 11548 states and 16107 transitions. [2019-09-08 05:13:06,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 05:13:06,996 INFO L276 IsEmpty]: Start isEmpty. Operand 11548 states and 16107 transitions. [2019-09-08 05:13:07,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 05:13:07,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:13:07,013 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:13:07,014 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:13:07,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:13:07,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1502556135, now seen corresponding path program 1 times [2019-09-08 05:13:07,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:13:07,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:13:07,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:07,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:13:07,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:13:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-08 05:13:07,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:13:07,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 05:13:07,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 05:13:07,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 05:13:07,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:13:07,342 INFO L87 Difference]: Start difference. First operand 11548 states and 16107 transitions. Second operand 20 states. [2019-09-08 05:13:09,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:13:09,306 INFO L93 Difference]: Finished difference Result 13881 states and 19127 transitions. [2019-09-08 05:13:09,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 05:13:09,307 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 334 [2019-09-08 05:13:09,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:13:09,332 INFO L225 Difference]: With dead ends: 13881 [2019-09-08 05:13:09,332 INFO L226 Difference]: Without dead ends: 11761 [2019-09-08 05:13:09,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=1429, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 05:13:09,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11761 states. [2019-09-08 05:13:09,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11761 to 11584. [2019-09-08 05:13:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11584 states. [2019-09-08 05:13:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11584 states to 11584 states and 16146 transitions. [2019-09-08 05:13:09,714 INFO L78 Accepts]: Start accepts. Automaton has 11584 states and 16146 transitions. Word has length 334 [2019-09-08 05:13:09,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:13:09,714 INFO L475 AbstractCegarLoop]: Abstraction has 11584 states and 16146 transitions. [2019-09-08 05:13:09,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 05:13:09,714 INFO L276 IsEmpty]: Start isEmpty. Operand 11584 states and 16146 transitions. [2019-09-08 05:13:09,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-08 05:13:09,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:13:09,730 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:13:09,730 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:13:09,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:13:09,730 INFO L82 PathProgramCache]: Analyzing trace with hash -2029949333, now seen corresponding path program 1 times [2019-09-08 05:13:09,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:13:09,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:13:09,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:09,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:13:09,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:13:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-08 05:13:10,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:13:10,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 05:13:10,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 05:13:10,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 05:13:10,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-09-08 05:13:10,181 INFO L87 Difference]: Start difference. First operand 11584 states and 16146 transitions. Second operand 24 states. [2019-09-08 05:13:12,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:13:12,920 INFO L93 Difference]: Finished difference Result 13887 states and 19150 transitions. [2019-09-08 05:13:12,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 05:13:12,921 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 335 [2019-09-08 05:13:12,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:13:12,943 INFO L225 Difference]: With dead ends: 13887 [2019-09-08 05:13:12,943 INFO L226 Difference]: Without dead ends: 11743 [2019-09-08 05:13:12,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=2281, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 05:13:12,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11743 states. [2019-09-08 05:13:13,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11743 to 11586. [2019-09-08 05:13:13,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11586 states. [2019-09-08 05:13:13,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11586 states to 11586 states and 16140 transitions. [2019-09-08 05:13:13,315 INFO L78 Accepts]: Start accepts. Automaton has 11586 states and 16140 transitions. Word has length 335 [2019-09-08 05:13:13,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:13:13,315 INFO L475 AbstractCegarLoop]: Abstraction has 11586 states and 16140 transitions. [2019-09-08 05:13:13,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 05:13:13,315 INFO L276 IsEmpty]: Start isEmpty. Operand 11586 states and 16140 transitions. [2019-09-08 05:13:13,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 05:13:13,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:13:13,331 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:13:13,331 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:13:13,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:13:13,331 INFO L82 PathProgramCache]: Analyzing trace with hash -888451600, now seen corresponding path program 2 times [2019-09-08 05:13:13,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:13:13,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:13:13,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:13,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:13:13,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:13:13,517 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 05:13:13,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:13:13,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:13:13,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:13:13,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:13:13,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:13:13,519 INFO L87 Difference]: Start difference. First operand 11586 states and 16140 transitions. Second operand 8 states. [2019-09-08 05:13:14,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:13:14,847 INFO L93 Difference]: Finished difference Result 12108 states and 16812 transitions. [2019-09-08 05:13:14,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:13:14,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 336 [2019-09-08 05:13:14,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:13:14,886 INFO L225 Difference]: With dead ends: 12108 [2019-09-08 05:13:14,886 INFO L226 Difference]: Without dead ends: 11983 [2019-09-08 05:13:14,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 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-09-08 05:13:14,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11983 states. [2019-09-08 05:13:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11983 to 11679. [2019-09-08 05:13:15,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11679 states. [2019-09-08 05:13:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11679 states to 11679 states and 16260 transitions. [2019-09-08 05:13:15,295 INFO L78 Accepts]: Start accepts. Automaton has 11679 states and 16260 transitions. Word has length 336 [2019-09-08 05:13:15,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:13:15,295 INFO L475 AbstractCegarLoop]: Abstraction has 11679 states and 16260 transitions. [2019-09-08 05:13:15,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:13:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 11679 states and 16260 transitions. [2019-09-08 05:13:15,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2019-09-08 05:13:15,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:13:15,312 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:13:15,313 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:13:15,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:13:15,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1640810372, now seen corresponding path program 1 times [2019-09-08 05:13:15,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:13:15,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:13:15,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:15,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:13:15,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:13:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-08 05:13:15,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:13:15,529 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-08 05:13:15,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:13:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:13:16,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 3920 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 05:13:16,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:13:16,264 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2019-09-08 05:13:16,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:13:16,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-09-08 05:13:16,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:13:16,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:13:16,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:13:16,284 INFO L87 Difference]: Start difference. First operand 11679 states and 16260 transitions. Second operand 9 states. [2019-09-08 05:13:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:13:18,755 INFO L93 Difference]: Finished difference Result 39075 states and 52946 transitions. [2019-09-08 05:13:18,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 05:13:18,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 449 [2019-09-08 05:13:18,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:13:18,826 INFO L225 Difference]: With dead ends: 39075 [2019-09-08 05:13:18,826 INFO L226 Difference]: Without dead ends: 31126 [2019-09-08 05:13:18,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:13:18,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31126 states. [2019-09-08 05:13:19,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31126 to 29942. [2019-09-08 05:13:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29942 states. [2019-09-08 05:13:19,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29942 states to 29942 states and 41122 transitions. [2019-09-08 05:13:19,960 INFO L78 Accepts]: Start accepts. Automaton has 29942 states and 41122 transitions. Word has length 449 [2019-09-08 05:13:19,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:13:19,960 INFO L475 AbstractCegarLoop]: Abstraction has 29942 states and 41122 transitions. [2019-09-08 05:13:19,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:13:19,960 INFO L276 IsEmpty]: Start isEmpty. Operand 29942 states and 41122 transitions. [2019-09-08 05:13:19,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-09-08 05:13:19,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:13:19,996 INFO L399 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:13:19,996 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:13:19,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:13:19,997 INFO L82 PathProgramCache]: Analyzing trace with hash 125151322, now seen corresponding path program 1 times [2019-09-08 05:13:19,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:13:19,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:13:19,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:19,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:13:19,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:13:20,348 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 05:13:20,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:13:20,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:13:20,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:13:20,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:13:20,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:13:20,350 INFO L87 Difference]: Start difference. First operand 29942 states and 41122 transitions. Second operand 3 states. [2019-09-08 05:13:21,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:13:21,384 INFO L93 Difference]: Finished difference Result 65557 states and 91813 transitions. [2019-09-08 05:13:21,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:13:21,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 389 [2019-09-08 05:13:21,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:13:21,474 INFO L225 Difference]: With dead ends: 65557 [2019-09-08 05:13:21,474 INFO L226 Difference]: Without dead ends: 35744 [2019-09-08 05:13:21,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:13:21,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35744 states. [2019-09-08 05:13:23,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35744 to 35736. [2019-09-08 05:13:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35736 states. [2019-09-08 05:13:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35736 states to 35736 states and 50675 transitions. [2019-09-08 05:13:23,132 INFO L78 Accepts]: Start accepts. Automaton has 35736 states and 50675 transitions. Word has length 389 [2019-09-08 05:13:23,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:13:23,132 INFO L475 AbstractCegarLoop]: Abstraction has 35736 states and 50675 transitions. [2019-09-08 05:13:23,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:13:23,132 INFO L276 IsEmpty]: Start isEmpty. Operand 35736 states and 50675 transitions. [2019-09-08 05:13:23,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2019-09-08 05:13:23,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:13:23,183 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:13:23,183 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:13:23,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:13:23,184 INFO L82 PathProgramCache]: Analyzing trace with hash -452111598, now seen corresponding path program 1 times [2019-09-08 05:13:23,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:13:23,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:13:23,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:23,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:13:23,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:13:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 35 proven. 4 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2019-09-08 05:13:23,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:13:23,420 INFO L223 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-09-08 05:13:23,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:13:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:13:23,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 4012 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:13:24,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:13:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-09-08 05:13:24,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:13:24,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-09-08 05:13:24,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 05:13:24,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 05:13:24,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-08 05:13:24,171 INFO L87 Difference]: Start difference. First operand 35736 states and 50675 transitions. Second operand 14 states. [2019-09-08 05:13:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:13:26,179 INFO L93 Difference]: Finished difference Result 57346 states and 78695 transitions. [2019-09-08 05:13:26,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:13:26,179 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 481 [2019-09-08 05:13:26,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:13:26,226 INFO L225 Difference]: With dead ends: 57346 [2019-09-08 05:13:26,226 INFO L226 Difference]: Without dead ends: 26211 [2019-09-08 05:13:26,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:13:26,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26211 states. [2019-09-08 05:13:27,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26211 to 26050. [2019-09-08 05:13:27,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26050 states. [2019-09-08 05:13:27,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26050 states to 26050 states and 38089 transitions. [2019-09-08 05:13:27,191 INFO L78 Accepts]: Start accepts. Automaton has 26050 states and 38089 transitions. Word has length 481 [2019-09-08 05:13:27,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:13:27,192 INFO L475 AbstractCegarLoop]: Abstraction has 26050 states and 38089 transitions. [2019-09-08 05:13:27,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 05:13:27,192 INFO L276 IsEmpty]: Start isEmpty. Operand 26050 states and 38089 transitions. [2019-09-08 05:13:27,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-09-08 05:13:27,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:13:27,255 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:13:27,255 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:13:27,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:13:27,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1094038579, now seen corresponding path program 1 times [2019-09-08 05:13:27,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:13:27,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:13:27,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:27,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:13:27,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:13:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-08 05:13:27,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:13:27,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:13:27,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:13:27,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:13:27,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:13:27,391 INFO L87 Difference]: Start difference. First operand 26050 states and 38089 transitions. Second operand 3 states. [2019-09-08 05:13:28,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:13:28,801 INFO L93 Difference]: Finished difference Result 62532 states and 93683 transitions. [2019-09-08 05:13:28,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:13:28,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 346 [2019-09-08 05:13:28,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:13:28,875 INFO L225 Difference]: With dead ends: 62532 [2019-09-08 05:13:28,875 INFO L226 Difference]: Without dead ends: 36910 [2019-09-08 05:13:28,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:13:28,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36910 states. [2019-09-08 05:13:30,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36910 to 36902. [2019-09-08 05:13:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36902 states. [2019-09-08 05:13:30,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36902 states to 36902 states and 55837 transitions. [2019-09-08 05:13:30,340 INFO L78 Accepts]: Start accepts. Automaton has 36902 states and 55837 transitions. Word has length 346 [2019-09-08 05:13:30,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:13:30,341 INFO L475 AbstractCegarLoop]: Abstraction has 36902 states and 55837 transitions. [2019-09-08 05:13:30,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:13:30,341 INFO L276 IsEmpty]: Start isEmpty. Operand 36902 states and 55837 transitions. [2019-09-08 05:13:30,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-09-08 05:13:30,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:13:30,453 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:13:30,453 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:13:30,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:13:30,454 INFO L82 PathProgramCache]: Analyzing trace with hash 993318691, now seen corresponding path program 1 times [2019-09-08 05:13:30,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:13:30,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:13:30,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:30,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:13:30,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:13:30,589 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-08 05:13:30,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:13:30,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:13:30,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:13:30,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:13:30,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:13:30,590 INFO L87 Difference]: Start difference. First operand 36902 states and 55837 transitions. Second operand 3 states. [2019-09-08 05:13:33,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:13:33,080 INFO L93 Difference]: Finished difference Result 93904 states and 144697 transitions. [2019-09-08 05:13:33,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:13:33,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2019-09-08 05:13:33,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:13:33,194 INFO L225 Difference]: With dead ends: 93904 [2019-09-08 05:13:33,194 INFO L226 Difference]: Without dead ends: 57599 [2019-09-08 05:13:33,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:13:33,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57599 states. [2019-09-08 05:13:37,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57599 to 57591. [2019-09-08 05:13:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57591 states. [2019-09-08 05:13:37,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57591 states to 57591 states and 89029 transitions. [2019-09-08 05:13:37,878 INFO L78 Accepts]: Start accepts. Automaton has 57591 states and 89029 transitions. Word has length 347 [2019-09-08 05:13:37,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:13:37,879 INFO L475 AbstractCegarLoop]: Abstraction has 57591 states and 89029 transitions. [2019-09-08 05:13:37,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:13:37,879 INFO L276 IsEmpty]: Start isEmpty. Operand 57591 states and 89029 transitions. [2019-09-08 05:13:38,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-09-08 05:13:38,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:13:38,066 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:13:38,066 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:13:38,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:13:38,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1478201246, now seen corresponding path program 1 times [2019-09-08 05:13:38,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:13:38,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:13:38,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:38,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:13:38,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:13:38,253 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-08 05:13:38,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:13:38,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:13:38,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:13:38,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:13:38,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:13:38,255 INFO L87 Difference]: Start difference. First operand 57591 states and 89029 transitions. Second operand 7 states. [2019-09-08 05:13:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:13:40,625 INFO L93 Difference]: Finished difference Result 114561 states and 178170 transitions. [2019-09-08 05:13:40,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:13:40,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 405 [2019-09-08 05:13:40,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:13:40,754 INFO L225 Difference]: With dead ends: 114561 [2019-09-08 05:13:40,754 INFO L226 Difference]: Without dead ends: 57663 [2019-09-08 05:13:40,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:13:40,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57663 states. [2019-09-08 05:13:43,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57663 to 57663. [2019-09-08 05:13:43,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57663 states. [2019-09-08 05:13:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57663 states to 57663 states and 89117 transitions. [2019-09-08 05:13:43,601 INFO L78 Accepts]: Start accepts. Automaton has 57663 states and 89117 transitions. Word has length 405 [2019-09-08 05:13:43,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:13:43,602 INFO L475 AbstractCegarLoop]: Abstraction has 57663 states and 89117 transitions. [2019-09-08 05:13:43,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:13:43,602 INFO L276 IsEmpty]: Start isEmpty. Operand 57663 states and 89117 transitions. [2019-09-08 05:13:43,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-09-08 05:13:43,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:13:43,740 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:13:43,740 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:13:43,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:13:43,740 INFO L82 PathProgramCache]: Analyzing trace with hash 927139746, now seen corresponding path program 1 times [2019-09-08 05:13:43,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:13:43,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:13:43,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:43,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:13:43,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:13:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 05:13:43,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:13:43,984 INFO L223 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-09-08 05:13:43,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:13:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:13:44,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 3837 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 05:13:44,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:13:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-08 05:13:46,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:13:46,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-09-08 05:13:46,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 05:13:46,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 05:13:46,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:13:46,742 INFO L87 Difference]: Start difference. First operand 57663 states and 89117 transitions. Second operand 17 states. [2019-09-08 05:13:52,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:13:52,122 INFO L93 Difference]: Finished difference Result 74017 states and 110975 transitions. [2019-09-08 05:13:52,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 05:13:52,123 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 406 [2019-09-08 05:13:52,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:13:52,245 INFO L225 Difference]: With dead ends: 74017 [2019-09-08 05:13:52,245 INFO L226 Difference]: Without dead ends: 61777 [2019-09-08 05:13:52,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=1185, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 05:13:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61777 states. [2019-09-08 05:13:54,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61777 to 61226. [2019-09-08 05:13:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61226 states. [2019-09-08 05:13:55,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61226 states to 61226 states and 94487 transitions. [2019-09-08 05:13:55,105 INFO L78 Accepts]: Start accepts. Automaton has 61226 states and 94487 transitions. Word has length 406 [2019-09-08 05:13:55,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:13:55,106 INFO L475 AbstractCegarLoop]: Abstraction has 61226 states and 94487 transitions. [2019-09-08 05:13:55,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 05:13:55,106 INFO L276 IsEmpty]: Start isEmpty. Operand 61226 states and 94487 transitions. [2019-09-08 05:13:55,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-08 05:13:55,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:13:55,253 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:13:55,254 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:13:55,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:13:55,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1170769133, now seen corresponding path program 1 times [2019-09-08 05:13:55,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:13:55,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:13:55,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:55,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:13:55,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:13:55,412 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-08 05:13:55,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:13:55,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:13:55,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:13:55,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:13:55,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:13:55,414 INFO L87 Difference]: Start difference. First operand 61226 states and 94487 transitions. Second operand 3 states. [2019-09-08 05:14:01,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:01,696 INFO L93 Difference]: Finished difference Result 159639 states and 249797 transitions. [2019-09-08 05:14:01,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:14:01,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2019-09-08 05:14:01,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:01,978 INFO L225 Difference]: With dead ends: 159639 [2019-09-08 05:14:01,978 INFO L226 Difference]: Without dead ends: 101336 [2019-09-08 05:14:02,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:14:02,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101336 states. [2019-09-08 05:14:07,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101336 to 101328. [2019-09-08 05:14:07,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101328 states. [2019-09-08 05:14:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101328 states to 101328 states and 158211 transitions. [2019-09-08 05:14:07,282 INFO L78 Accepts]: Start accepts. Automaton has 101328 states and 158211 transitions. Word has length 348 [2019-09-08 05:14:07,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:07,282 INFO L475 AbstractCegarLoop]: Abstraction has 101328 states and 158211 transitions. [2019-09-08 05:14:07,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:14:07,283 INFO L276 IsEmpty]: Start isEmpty. Operand 101328 states and 158211 transitions. [2019-09-08 05:14:07,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-09-08 05:14:07,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:07,571 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:14:07,571 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:07,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:07,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1644530173, now seen corresponding path program 1 times [2019-09-08 05:14:07,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:07,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:07,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:07,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:07,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:08,189 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-08 05:14:08,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:08,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:14:08,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:14:08,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:14:08,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:14:08,191 INFO L87 Difference]: Start difference. First operand 101328 states and 158211 transitions. Second operand 3 states. [2019-09-08 05:14:17,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:17,883 INFO L93 Difference]: Finished difference Result 274362 states and 432115 transitions. [2019-09-08 05:14:17,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:14:17,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 349 [2019-09-08 05:14:17,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:18,383 INFO L225 Difference]: With dead ends: 274362 [2019-09-08 05:14:18,383 INFO L226 Difference]: Without dead ends: 176965 [2019-09-08 05:14:18,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:14:18,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176965 states. [2019-09-08 05:14:31,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176965 to 176957. [2019-09-08 05:14:31,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176957 states. [2019-09-08 05:14:31,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176957 states to 176957 states and 276976 transitions. [2019-09-08 05:14:31,764 INFO L78 Accepts]: Start accepts. Automaton has 176957 states and 276976 transitions. Word has length 349 [2019-09-08 05:14:31,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:31,764 INFO L475 AbstractCegarLoop]: Abstraction has 176957 states and 276976 transitions. [2019-09-08 05:14:31,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:14:31,764 INFO L276 IsEmpty]: Start isEmpty. Operand 176957 states and 276976 transitions. [2019-09-08 05:14:32,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-08 05:14:32,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:32,374 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:14:32,374 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:32,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:32,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1699974669, now seen corresponding path program 1 times [2019-09-08 05:14:32,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:32,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:32,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:32,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:32,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-08 05:14:32,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:32,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:14:32,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:14:32,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:14:32,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:14:32,524 INFO L87 Difference]: Start difference. First operand 176957 states and 276976 transitions. Second operand 3 states. [2019-09-08 05:14:50,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:50,120 INFO L93 Difference]: Finished difference Result 325446 states and 508842 transitions. [2019-09-08 05:14:50,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:14:50,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2019-09-08 05:14:50,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:50,930 INFO L225 Difference]: With dead ends: 325446 [2019-09-08 05:14:50,930 INFO L226 Difference]: Without dead ends: 313206 [2019-09-08 05:14:51,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:14:51,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313206 states. [2019-09-08 05:15:13,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313206 to 313198. [2019-09-08 05:15:13,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313198 states. [2019-09-08 05:15:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313198 states to 313198 states and 488167 transitions. [2019-09-08 05:15:15,266 INFO L78 Accepts]: Start accepts. Automaton has 313198 states and 488167 transitions. Word has length 350 [2019-09-08 05:15:15,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:15:15,266 INFO L475 AbstractCegarLoop]: Abstraction has 313198 states and 488167 transitions. [2019-09-08 05:15:15,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:15:15,267 INFO L276 IsEmpty]: Start isEmpty. Operand 313198 states and 488167 transitions. [2019-09-08 05:15:16,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-09-08 05:15:16,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:15:16,364 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:15:16,364 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:15:16,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:15:16,364 INFO L82 PathProgramCache]: Analyzing trace with hash 2037007587, now seen corresponding path program 1 times [2019-09-08 05:15:16,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:15:16,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:15:16,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:16,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:15:16,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:16,577 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-08 05:15:16,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:15:16,577 INFO L223 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-09-08 05:15:16,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:15:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:17,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 3476 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:15:17,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:15:17,260 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 05:15:17,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:15:17,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2019-09-08 05:15:17,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:15:17,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:15:17,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:15:17,268 INFO L87 Difference]: Start difference. First operand 313198 states and 488167 transitions. Second operand 18 states. [2019-09-08 05:15:38,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:15:38,380 INFO L93 Difference]: Finished difference Result 324502 states and 502981 transitions. [2019-09-08 05:15:38,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 05:15:38,381 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 351 [2019-09-08 05:15:38,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:15:39,141 INFO L225 Difference]: With dead ends: 324502 [2019-09-08 05:15:39,141 INFO L226 Difference]: Without dead ends: 313726 [2019-09-08 05:15:39,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 348 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2019-09-08 05:15:39,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313726 states. [2019-09-08 05:16:04,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313726 to 313342. [2019-09-08 05:16:04,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313342 states. [2019-09-08 05:16:05,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313342 states to 313342 states and 488311 transitions. [2019-09-08 05:16:05,267 INFO L78 Accepts]: Start accepts. Automaton has 313342 states and 488311 transitions. Word has length 351 [2019-09-08 05:16:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:16:05,267 INFO L475 AbstractCegarLoop]: Abstraction has 313342 states and 488311 transitions. [2019-09-08 05:16:05,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:16:05,267 INFO L276 IsEmpty]: Start isEmpty. Operand 313342 states and 488311 transitions. [2019-09-08 05:16:06,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-08 05:16:06,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:16:06,333 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:16:06,333 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:16:06,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:16:06,333 INFO L82 PathProgramCache]: Analyzing trace with hash 530616273, now seen corresponding path program 1 times [2019-09-08 05:16:06,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:16:06,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:16:06,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:06,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:16:06,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:16:06,674 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-08 05:16:06,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:16:06,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:16:06,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:16:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:16:07,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 3477 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 05:16:07,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:16:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 05:16:07,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:16:07,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [20] total 38 [2019-09-08 05:16:07,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 05:16:07,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 05:16:07,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1315, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 05:16:07,737 INFO L87 Difference]: Start difference. First operand 313342 states and 488311 transitions. Second operand 38 states. [2019-09-08 05:16:27,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:16:27,767 INFO L93 Difference]: Finished difference Result 325683 states and 505999 transitions. [2019-09-08 05:16:27,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 05:16:27,768 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 352 [2019-09-08 05:16:27,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:16:28,613 INFO L225 Difference]: With dead ends: 325683 [2019-09-08 05:16:28,614 INFO L226 Difference]: Without dead ends: 313715 [2019-09-08 05:16:28,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=181, Invalid=2575, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 05:16:28,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313715 states. [2019-09-08 05:16:54,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313715 to 312829. [2019-09-08 05:16:54,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312829 states. [2019-09-08 05:16:55,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312829 states to 312829 states and 487583 transitions. [2019-09-08 05:16:55,505 INFO L78 Accepts]: Start accepts. Automaton has 312829 states and 487583 transitions. Word has length 352 [2019-09-08 05:16:55,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:16:55,505 INFO L475 AbstractCegarLoop]: Abstraction has 312829 states and 487583 transitions. [2019-09-08 05:16:55,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 05:16:55,505 INFO L276 IsEmpty]: Start isEmpty. Operand 312829 states and 487583 transitions. [2019-09-08 05:16:56,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-08 05:16:56,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:16:56,591 INFO L399 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:16:56,591 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:16:56,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:16:56,592 INFO L82 PathProgramCache]: Analyzing trace with hash 254747786, now seen corresponding path program 1 times [2019-09-08 05:16:56,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:16:56,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:16:56,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:56,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:16:56,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:16:57,395 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-08 05:16:57,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:16:57,396 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:16:57,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:16:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:16:57,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 3500 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 05:16:57,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:16:58,116 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:16:58,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:16:58,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 22 [2019-09-08 05:16:58,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 05:16:58,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 05:16:58,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:16:58,124 INFO L87 Difference]: Start difference. First operand 312829 states and 487583 transitions. Second operand 22 states. [2019-09-08 05:17:16,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:17:16,676 INFO L93 Difference]: Finished difference Result 317655 states and 493915 transitions. [2019-09-08 05:17:16,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 05:17:16,676 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 353 [2019-09-08 05:17:16,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:17:17,482 INFO L225 Difference]: With dead ends: 317655 [2019-09-08 05:17:17,482 INFO L226 Difference]: Without dead ends: 310063 [2019-09-08 05:17:17,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2019-09-08 05:17:17,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310063 states. [2019-09-08 05:17:44,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310063 to 309819. [2019-09-08 05:17:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309819 states. [2019-09-08 05:17:45,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309819 states to 309819 states and 484008 transitions. [2019-09-08 05:17:45,265 INFO L78 Accepts]: Start accepts. Automaton has 309819 states and 484008 transitions. Word has length 353 [2019-09-08 05:17:45,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:17:45,266 INFO L475 AbstractCegarLoop]: Abstraction has 309819 states and 484008 transitions. [2019-09-08 05:17:45,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 05:17:45,266 INFO L276 IsEmpty]: Start isEmpty. Operand 309819 states and 484008 transitions. [2019-09-08 05:17:46,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-09-08 05:17:46,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:17:46,454 INFO L399 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:17:46,454 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:17:46,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:17:46,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1372295872, now seen corresponding path program 1 times [2019-09-08 05:17:46,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:17:46,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:17:46,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:46,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:17:46,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:17:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-08 05:17:46,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:17:46,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 05:17:46,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 05:17:46,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 05:17:46,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-09-08 05:17:46,905 INFO L87 Difference]: Start difference. First operand 309819 states and 484008 transitions. Second operand 24 states. [2019-09-08 05:18:04,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:18:04,248 INFO L93 Difference]: Finished difference Result 311133 states and 485734 transitions. [2019-09-08 05:18:04,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 05:18:04,248 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 359 [2019-09-08 05:18:04,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:18:05,050 INFO L225 Difference]: With dead ends: 311133 [2019-09-08 05:18:05,050 INFO L226 Difference]: Without dead ends: 309120 [2019-09-08 05:18:05,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=2571, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 05:18:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309120 states. [2019-09-08 05:18:30,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309120 to 308950. [2019-09-08 05:18:30,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308950 states. [2019-09-08 05:18:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308950 states to 308950 states and 482930 transitions. [2019-09-08 05:18:31,401 INFO L78 Accepts]: Start accepts. Automaton has 308950 states and 482930 transitions. Word has length 359 [2019-09-08 05:18:31,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:18:31,401 INFO L475 AbstractCegarLoop]: Abstraction has 308950 states and 482930 transitions. [2019-09-08 05:18:31,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 05:18:31,402 INFO L276 IsEmpty]: Start isEmpty. Operand 308950 states and 482930 transitions. [2019-09-08 05:18:32,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-09-08 05:18:32,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:18:32,470 INFO L399 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:18:32,470 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:18:32,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:18:32,470 INFO L82 PathProgramCache]: Analyzing trace with hash -861592115, now seen corresponding path program 1 times [2019-09-08 05:18:32,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:18:32,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:18:32,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:32,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:18:32,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 05:18:33,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:18:33,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:18:33,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:18:33,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:18:33,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:18:33,992 INFO L87 Difference]: Start difference. First operand 308950 states and 482930 transitions. Second operand 18 states. [2019-09-08 05:18:56,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:18:56,234 INFO L93 Difference]: Finished difference Result 312961 states and 488213 transitions. [2019-09-08 05:18:56,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 05:18:56,238 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 361 [2019-09-08 05:18:56,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:18:56,936 INFO L225 Difference]: With dead ends: 312961 [2019-09-08 05:18:56,936 INFO L226 Difference]: Without dead ends: 309047 [2019-09-08 05:18:57,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=1078, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 05:18:57,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309047 states. [2019-09-08 05:19:21,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309047 to 308950. [2019-09-08 05:19:21,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308950 states. [2019-09-08 05:19:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308950 states to 308950 states and 482914 transitions. [2019-09-08 05:19:22,266 INFO L78 Accepts]: Start accepts. Automaton has 308950 states and 482914 transitions. Word has length 361 [2019-09-08 05:19:22,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:19:22,266 INFO L475 AbstractCegarLoop]: Abstraction has 308950 states and 482914 transitions. [2019-09-08 05:19:22,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:19:22,266 INFO L276 IsEmpty]: Start isEmpty. Operand 308950 states and 482914 transitions. [2019-09-08 05:19:23,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-09-08 05:19:23,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:19:23,321 INFO L399 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:19:23,321 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:19:23,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:19:23,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1031206593, now seen corresponding path program 1 times [2019-09-08 05:19:23,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:19:23,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:19:23,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:23,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:19:23,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:19:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 05:19:23,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:19:23,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 05:19:23,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 05:19:23,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 05:19:23,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:19:23,634 INFO L87 Difference]: Start difference. First operand 308950 states and 482914 transitions. Second operand 20 states. [2019-09-08 05:19:40,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:19:40,462 INFO L93 Difference]: Finished difference Result 312775 states and 487983 transitions. [2019-09-08 05:19:40,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 05:19:40,463 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 362 [2019-09-08 05:19:40,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:19:41,187 INFO L225 Difference]: With dead ends: 312775 [2019-09-08 05:19:41,187 INFO L226 Difference]: Without dead ends: 309087 [2019-09-08 05:19:41,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=1429, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 05:19:41,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309087 states. [2019-09-08 05:20:06,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309087 to 308962. [2019-09-08 05:20:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308962 states. [2019-09-08 05:20:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308962 states to 308962 states and 482921 transitions. [2019-09-08 05:20:08,159 INFO L78 Accepts]: Start accepts. Automaton has 308962 states and 482921 transitions. Word has length 362 [2019-09-08 05:20:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:08,160 INFO L475 AbstractCegarLoop]: Abstraction has 308962 states and 482921 transitions. [2019-09-08 05:20:08,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 05:20:08,160 INFO L276 IsEmpty]: Start isEmpty. Operand 308962 states and 482921 transitions. [2019-09-08 05:20:09,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-09-08 05:20:09,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:09,353 INFO L399 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:09,353 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:09,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:09,354 INFO L82 PathProgramCache]: Analyzing trace with hash -992346929, now seen corresponding path program 1 times [2019-09-08 05:20:09,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:09,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:09,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:09,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:09,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:09,777 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-08 05:20:09,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:09,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 05:20:09,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 05:20:09,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 05:20:09,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-09-08 05:20:09,779 INFO L87 Difference]: Start difference. First operand 308962 states and 482921 transitions. Second operand 24 states. [2019-09-08 05:20:31,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:31,133 INFO L93 Difference]: Finished difference Result 312767 states and 487998 transitions. [2019-09-08 05:20:31,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 05:20:31,133 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 363 [2019-09-08 05:20:31,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:31,911 INFO L225 Difference]: With dead ends: 312767 [2019-09-08 05:20:31,911 INFO L226 Difference]: Without dead ends: 309055 [2019-09-08 05:20:31,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=2281, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 05:20:32,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309055 states. [2019-09-08 05:20:58,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309055 to 308958. [2019-09-08 05:20:58,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308958 states. [2019-09-08 05:20:58,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308958 states to 308958 states and 482899 transitions. [2019-09-08 05:20:58,779 INFO L78 Accepts]: Start accepts. Automaton has 308958 states and 482899 transitions. Word has length 363 [2019-09-08 05:20:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:58,779 INFO L475 AbstractCegarLoop]: Abstraction has 308958 states and 482899 transitions. [2019-09-08 05:20:58,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 05:20:58,779 INFO L276 IsEmpty]: Start isEmpty. Operand 308958 states and 482899 transitions. [2019-09-08 05:20:59,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-08 05:20:59,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:59,960 INFO L399 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:59,960 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:59,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:59,961 INFO L82 PathProgramCache]: Analyzing trace with hash 467499280, now seen corresponding path program 1 times [2019-09-08 05:20:59,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:59,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:59,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:59,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:59,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-08 05:21:00,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:21:00,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:21:00,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:21:00,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:21:00,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:21:00,594 INFO L87 Difference]: Start difference. First operand 308958 states and 482899 transitions. Second operand 8 states. [2019-09-08 05:21:15,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:15,597 INFO L93 Difference]: Finished difference Result 309801 states and 483993 transitions. [2019-09-08 05:21:15,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:21:15,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 364 [2019-09-08 05:21:15,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:16,344 INFO L225 Difference]: With dead ends: 309801 [2019-09-08 05:21:16,344 INFO L226 Difference]: Without dead ends: 309652 [2019-09-08 05:21:16,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 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-09-08 05:21:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309652 states. [2019-09-08 05:21:43,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309652 to 309032. [2019-09-08 05:21:43,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309032 states. [2019-09-08 05:21:44,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309032 states to 309032 states and 482988 transitions. [2019-09-08 05:21:44,066 INFO L78 Accepts]: Start accepts. Automaton has 309032 states and 482988 transitions. Word has length 364 [2019-09-08 05:21:44,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:21:44,066 INFO L475 AbstractCegarLoop]: Abstraction has 309032 states and 482988 transitions. [2019-09-08 05:21:44,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:21:44,066 INFO L276 IsEmpty]: Start isEmpty. Operand 309032 states and 482988 transitions. [2019-09-08 05:21:46,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-08 05:21:46,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:21:46,058 INFO L399 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:21:46,058 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:21:46,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:21:46,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1355002961, now seen corresponding path program 1 times [2019-09-08 05:21:46,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:21:46,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:21:46,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:46,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:46,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:46,484 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-08 05:21:46,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:21:46,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 05:21:46,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 05:21:46,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 05:21:46,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-09-08 05:21:46,485 INFO L87 Difference]: Start difference. First operand 309032 states and 482988 transitions. Second operand 24 states. [2019-09-08 05:22:02,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:02,897 INFO L93 Difference]: Finished difference Result 310293 states and 484639 transitions. [2019-09-08 05:22:02,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 05:22:02,898 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 364 [2019-09-08 05:22:02,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:03,639 INFO L225 Difference]: With dead ends: 310293 [2019-09-08 05:22:03,639 INFO L226 Difference]: Without dead ends: 308274 [2019-09-08 05:22:03,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=2571, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 05:22:03,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308274 states.