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_spec8_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:04:31,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:04:31,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:04:31,644 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:04:31,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:04:31,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:04:31,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:04:31,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:04:31,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:04:31,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:04:31,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:04:31,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:04:31,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:04:31,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:04:31,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:04:31,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:04:31,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:04:31,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:04:31,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:04:31,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:04:31,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:04:31,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:04:31,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:04:31,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:04:31,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:04:31,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:04:31,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:04:31,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:04:31,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:04:31,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:04:31,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:04:31,672 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:04:31,673 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:04:31,674 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:04:31,675 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:04:31,675 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:04:31,676 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:04:31,676 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:04:31,676 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:04:31,677 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:04:31,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:04:31,678 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 14:04:31,693 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:04:31,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:04:31,695 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:04:31,695 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:04:31,695 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:04:31,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:04:31,695 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:04:31,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:04:31,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:04:31,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:04:31,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:04:31,696 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:04:31,696 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:04:31,697 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:04:31,697 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:04:31,697 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:04:31,697 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:04:31,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:04:31,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:04:31,698 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:04:31,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:04:31,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:04:31,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:04:31,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:04:31,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:04:31,699 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:04:31,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:04:31,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:04:31,700 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:04:31,730 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:04:31,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:04:31,744 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:04:31,746 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:04:31,746 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:04:31,747 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec8_productSimulator.cil.c [2019-10-02 14:04:31,807 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89b283a63/c2030f9aa4c04eb2bb205fc6d097256a/FLAGb69d3ebd4 [2019-10-02 14:04:32,506 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:04:32,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec8_productSimulator.cil.c [2019-10-02 14:04:32,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89b283a63/c2030f9aa4c04eb2bb205fc6d097256a/FLAGb69d3ebd4 [2019-10-02 14:04:32,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89b283a63/c2030f9aa4c04eb2bb205fc6d097256a [2019-10-02 14:04:32,650 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:04:32,652 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:04:32,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:04:32,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:04:32,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:04:32,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:04:32" (1/1) ... [2019-10-02 14:04:32,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@265812f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:04:32, skipping insertion in model container [2019-10-02 14:04:32,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:04:32" (1/1) ... [2019-10-02 14:04:32,668 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:04:32,772 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:04:33,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:04:33,549 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:04:33,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:04:33,835 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:04:33,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:04:33 WrapperNode [2019-10-02 14:04:33,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:04:33,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:04:33,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:04:33,837 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:04:33,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:04:33" (1/1) ... [2019-10-02 14:04:33,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:04:33" (1/1) ... [2019-10-02 14:04:33,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:04:33" (1/1) ... [2019-10-02 14:04:33,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:04:33" (1/1) ... [2019-10-02 14:04:33,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:04:33" (1/1) ... [2019-10-02 14:04:34,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:04:33" (1/1) ... [2019-10-02 14:04:34,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:04:33" (1/1) ... [2019-10-02 14:04:34,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:04:34,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:04:34,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:04:34,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:04:34,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:04:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:04:34,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:04:34,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:04:34,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 14:04:34,163 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 14:04:34,164 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 14:04:34,165 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 14:04:34,165 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 14:04:34,165 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 14:04:34,166 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 14:04:34,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 14:04:34,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 14:04:34,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 14:04:34,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 14:04:34,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 14:04:34,169 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 14:04:34,169 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 14:04:34,172 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 14:04:34,172 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 14:04:34,173 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 14:04:34,173 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 14:04:34,173 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 14:04:34,174 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 14:04:34,174 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 14:04:34,174 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 14:04:34,174 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 14:04:34,174 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 14:04:34,174 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 14:04:34,175 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 14:04:34,175 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 14:04:34,175 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 14:04:34,175 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 14:04:34,175 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 14:04:34,176 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 14:04:34,176 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 14:04:34,176 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 14:04:34,176 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 14:04:34,176 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 14:04:34,177 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 14:04:34,177 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 14:04:34,177 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 14:04:34,177 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 14:04:34,178 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 14:04:34,178 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 14:04:34,179 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 14:04:34,179 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 14:04:34,179 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 14:04:34,179 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 14:04:34,179 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 14:04:34,180 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 14:04:34,180 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 14:04:34,180 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 14:04:34,180 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 14:04:34,180 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 14:04:34,181 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 14:04:34,181 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 14:04:34,181 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 14:04:34,181 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 14:04:34,181 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 14:04:34,182 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 14:04:34,182 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 14:04:34,182 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 14:04:34,183 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 14:04:34,183 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 14:04:34,183 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 14:04:34,183 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 14:04:34,183 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-10-02 14:04:34,184 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-10-02 14:04:34,184 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2019-10-02 14:04:34,184 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Encrypt [2019-10-02 14:04:34,185 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2019-10-02 14:04:34,185 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Sign [2019-10-02 14:04:34,185 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2019-10-02 14:04:34,185 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Verify [2019-10-02 14:04:34,186 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 14:04:34,187 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2019-10-02 14:04:34,187 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__role__Encrypt [2019-10-02 14:04:34,187 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 14:04:34,187 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 14:04:34,187 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 14:04:34,187 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 14:04:34,188 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2019-10-02 14:04:34,188 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Encrypt [2019-10-02 14:04:34,189 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2019-10-02 14:04:34,189 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__AddressBook [2019-10-02 14:04:34,189 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2019-10-02 14:04:34,189 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Sign [2019-10-02 14:04:34,189 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 14:04:34,190 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 14:04:34,191 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2019-10-02 14:04:34,191 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__AutoResponder [2019-10-02 14:04:34,192 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2019-10-02 14:04:34,192 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Forward [2019-10-02 14:04:34,192 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2019-10-02 14:04:34,192 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Verify [2019-10-02 14:04:34,193 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2019-10-02 14:04:34,193 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Decrypt [2019-10-02 14:04:34,193 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 14:04:34,193 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 14:04:34,193 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 14:04:34,193 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 14:04:34,194 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 14:04:34,194 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 14:04:34,194 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 14:04:34,194 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 14:04:34,194 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 14:04:34,194 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 14:04:34,195 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 14:04:34,195 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 14:04:34,195 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 14:04:34,195 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 14:04:34,195 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2019-10-02 14:04:34,196 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__role__Keys [2019-10-02 14:04:34,196 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 14:04:34,196 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2019-10-02 14:04:34,196 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__role__Keys [2019-10-02 14:04:34,197 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 14:04:34,197 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2019-10-02 14:04:34,197 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__role__Keys [2019-10-02 14:04:34,197 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 14:04:34,197 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 14:04:34,198 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 14:04:34,198 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 14:04:34,198 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:04:34,198 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 14:04:34,200 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 14:04:34,200 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 14:04:34,200 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 14:04:34,200 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 14:04:34,201 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 14:04:34,201 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 14:04:34,201 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 14:04:34,201 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 14:04:34,202 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 14:04:34,202 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 14:04:34,202 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 14:04:34,202 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 14:04:34,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:04:34,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:04:34,203 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 14:04:34,204 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 14:04:34,208 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 14:04:34,209 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 14:04:34,209 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 14:04:34,210 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 14:04:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 14:04:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 14:04:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 14:04:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 14:04:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 14:04:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 14:04:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 14:04:34,221 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 14:04:34,221 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 14:04:34,222 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 14:04:34,222 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 14:04:34,222 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 14:04:34,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 14:04:34,222 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 14:04:34,223 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 14:04:34,223 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 14:04:34,223 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 14:04:34,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 14:04:34,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 14:04:34,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 14:04:34,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 14:04:34,224 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 14:04:34,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 14:04:34,224 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 14:04:34,224 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 14:04:34,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 14:04:34,225 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 14:04:34,225 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 14:04:34,225 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 14:04:34,225 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 14:04:34,225 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 14:04:34,225 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 14:04:34,226 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 14:04:34,226 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 14:04:34,226 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 14:04:34,226 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 14:04:34,226 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 14:04:34,227 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 14:04:34,227 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 14:04:34,227 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 14:04:34,227 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 14:04:34,227 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 14:04:34,227 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 14:04:34,228 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 14:04:34,228 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 14:04:34,228 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 14:04:34,228 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 14:04:34,228 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 14:04:34,228 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 14:04:34,228 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 14:04:34,229 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 14:04:34,229 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 14:04:34,229 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 14:04:34,229 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 14:04:34,229 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 14:04:34,229 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 14:04:34,230 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 14:04:34,230 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 14:04:34,230 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 14:04:34,230 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 14:04:34,230 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 14:04:34,230 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 14:04:34,231 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 14:04:34,231 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 14:04:34,231 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 14:04:34,231 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 14:04:34,231 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 14:04:34,272 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 14:04:34,272 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 14:04:34,273 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 14:04:34,273 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 14:04:34,273 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 14:04:34,273 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 14:04:34,273 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 14:04:34,273 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 14:04:34,273 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 14:04:34,273 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 14:04:34,274 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 14:04:34,274 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 14:04:34,274 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 14:04:34,274 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 14:04:34,274 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-10-02 14:04:34,274 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-10-02 14:04:34,275 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 14:04:34,275 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 14:04:34,275 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 14:04:34,275 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 14:04:34,275 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2019-10-02 14:04:34,275 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Encrypt [2019-10-02 14:04:34,275 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2019-10-02 14:04:34,276 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Sign [2019-10-02 14:04:34,276 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2019-10-02 14:04:34,276 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Verify [2019-10-02 14:04:34,276 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2019-10-02 14:04:34,276 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__role__Encrypt [2019-10-02 14:04:34,276 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 14:04:34,277 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 14:04:34,277 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 14:04:34,277 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 14:04:34,277 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 14:04:34,277 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 14:04:34,277 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 14:04:34,277 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 14:04:34,278 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 14:04:34,278 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 14:04:34,278 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 14:04:34,278 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 14:04:34,278 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 14:04:34,278 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 14:04:34,278 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 14:04:34,279 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 14:04:34,279 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 14:04:34,279 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2019-10-02 14:04:34,279 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Encrypt [2019-10-02 14:04:34,279 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2019-10-02 14:04:34,279 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__AddressBook [2019-10-02 14:04:34,279 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2019-10-02 14:04:34,280 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Sign [2019-10-02 14:04:34,280 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2019-10-02 14:04:34,280 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__AutoResponder [2019-10-02 14:04:34,280 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2019-10-02 14:04:34,280 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Forward [2019-10-02 14:04:34,282 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2019-10-02 14:04:34,287 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Verify [2019-10-02 14:04:34,287 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2019-10-02 14:04:34,287 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Decrypt [2019-10-02 14:04:34,287 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 14:04:34,287 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 14:04:34,290 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 14:04:34,290 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 14:04:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 14:04:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:04:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 14:04:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 14:04:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2019-10-02 14:04:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__role__Keys [2019-10-02 14:04:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2019-10-02 14:04:34,292 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__role__Keys [2019-10-02 14:04:34,292 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2019-10-02 14:04:34,292 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__role__Keys [2019-10-02 14:04:34,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:04:34,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 14:04:34,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:04:36,985 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:04:36,986 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 14:04:36,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:04:36 BoogieIcfgContainer [2019-10-02 14:04:36,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:04:36,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:04:36,990 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:04:36,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:04:36,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:04:32" (1/3) ... [2019-10-02 14:04:36,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a5f007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:04:36, skipping insertion in model container [2019-10-02 14:04:36,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:04:33" (2/3) ... [2019-10-02 14:04:36,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a5f007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:04:36, skipping insertion in model container [2019-10-02 14:04:36,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:04:36" (3/3) ... [2019-10-02 14:04:37,000 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_productSimulator.cil.c [2019-10-02 14:04:37,012 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:04:37,032 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:04:37,053 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:04:37,107 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:04:37,108 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:04:37,109 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:04:37,109 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:04:37,109 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:04:37,109 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:04:37,109 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:04:37,109 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:04:37,110 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:04:37,162 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states. [2019-10-02 14:04:37,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 14:04:37,201 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:04:37,203 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:04:37,206 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:04:37,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:04:37,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1272279262, now seen corresponding path program 1 times [2019-10-02 14:04:37,264 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:04:37,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:04:37,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:37,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:04:37,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:04:38,150 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 14:04:38,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:04:38,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:04:38,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:04:38,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:04:38,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:04:38,177 INFO L87 Difference]: Start difference. First operand 818 states. Second operand 6 states. [2019-10-02 14:04:38,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:04:38,448 INFO L93 Difference]: Finished difference Result 1554 states and 2145 transitions. [2019-10-02 14:04:38,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 14:04:38,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2019-10-02 14:04:38,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:04:38,477 INFO L225 Difference]: With dead ends: 1554 [2019-10-02 14:04:38,478 INFO L226 Difference]: Without dead ends: 789 [2019-10-02 14:04:38,490 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:04:38,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-10-02 14:04:38,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2019-10-02 14:04:38,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-10-02 14:04:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1073 transitions. [2019-10-02 14:04:38,654 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1073 transitions. Word has length 170 [2019-10-02 14:04:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:04:38,662 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1073 transitions. [2019-10-02 14:04:38,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:04:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1073 transitions. [2019-10-02 14:04:38,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 14:04:38,675 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:04:38,676 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:04:38,676 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:04:38,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:04:38,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1687310560, now seen corresponding path program 1 times [2019-10-02 14:04:38,678 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:04:38,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:04:38,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:38,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:04:38,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:04:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 14:04:39,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:04:39,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:04:39,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:04:39,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:04:39,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:04:39,029 INFO L87 Difference]: Start difference. First operand 789 states and 1073 transitions. Second operand 4 states. [2019-10-02 14:04:39,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:04:39,842 INFO L93 Difference]: Finished difference Result 1541 states and 2131 transitions. [2019-10-02 14:04:39,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:04:39,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-10-02 14:04:39,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:04:39,854 INFO L225 Difference]: With dead ends: 1541 [2019-10-02 14:04:39,854 INFO L226 Difference]: Without dead ends: 788 [2019-10-02 14:04:39,858 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:04:39,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-10-02 14:04:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2019-10-02 14:04:39,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-10-02 14:04:39,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1063 transitions. [2019-10-02 14:04:39,912 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1063 transitions. Word has length 176 [2019-10-02 14:04:39,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:04:39,913 INFO L475 AbstractCegarLoop]: Abstraction has 788 states and 1063 transitions. [2019-10-02 14:04:39,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:04:39,913 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1063 transitions. [2019-10-02 14:04:39,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 14:04:39,928 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:04:39,928 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:04:39,929 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:04:39,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:04:39,929 INFO L82 PathProgramCache]: Analyzing trace with hash -544519570, now seen corresponding path program 1 times [2019-10-02 14:04:39,929 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:04:39,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:04:39,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:39,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:04:39,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:04:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 14:04:40,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:04:40,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:04:40,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:04:40,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:04:40,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:04:40,202 INFO L87 Difference]: Start difference. First operand 788 states and 1063 transitions. Second operand 3 states. [2019-10-02 14:04:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:04:40,432 INFO L93 Difference]: Finished difference Result 1534 states and 2090 transitions. [2019-10-02 14:04:40,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:04:40,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-10-02 14:04:40,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:04:40,441 INFO L225 Difference]: With dead ends: 1534 [2019-10-02 14:04:40,441 INFO L226 Difference]: Without dead ends: 787 [2019-10-02 14:04:40,445 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:04:40,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-10-02 14:04:40,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 787. [2019-10-02 14:04:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2019-10-02 14:04:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1059 transitions. [2019-10-02 14:04:40,485 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1059 transitions. Word has length 194 [2019-10-02 14:04:40,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:04:40,486 INFO L475 AbstractCegarLoop]: Abstraction has 787 states and 1059 transitions. [2019-10-02 14:04:40,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:04:40,487 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1059 transitions. [2019-10-02 14:04:40,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 14:04:40,492 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:04:40,493 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:04:40,493 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:04:40,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:04:40,494 INFO L82 PathProgramCache]: Analyzing trace with hash -428530514, now seen corresponding path program 1 times [2019-10-02 14:04:40,494 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:04:40,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:04:40,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:40,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:04:40,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:04:40,745 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 14:04:40,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:04:40,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:04:40,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:04:40,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:04:40,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:04:40,748 INFO L87 Difference]: Start difference. First operand 787 states and 1059 transitions. Second operand 4 states. [2019-10-02 14:04:41,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:04:41,522 INFO L93 Difference]: Finished difference Result 1505 states and 2036 transitions. [2019-10-02 14:04:41,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:04:41,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-10-02 14:04:41,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:04:41,529 INFO L225 Difference]: With dead ends: 1505 [2019-10-02 14:04:41,530 INFO L226 Difference]: Without dead ends: 784 [2019-10-02 14:04:41,532 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:04:41,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-10-02 14:04:41,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2019-10-02 14:04:41,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-10-02 14:04:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1042 transitions. [2019-10-02 14:04:41,564 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1042 transitions. Word has length 195 [2019-10-02 14:04:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:04:41,564 INFO L475 AbstractCegarLoop]: Abstraction has 784 states and 1042 transitions. [2019-10-02 14:04:41,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:04:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1042 transitions. [2019-10-02 14:04:41,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 14:04:41,569 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:04:41,569 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:04:41,570 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:04:41,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:04:41,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1946876725, now seen corresponding path program 1 times [2019-10-02 14:04:41,570 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:04:41,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:04:41,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:41,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:04:41,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:04:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 14:04:41,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:04:41,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:04:41,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:04:41,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:04:41,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:04:41,764 INFO L87 Difference]: Start difference. First operand 784 states and 1042 transitions. Second operand 3 states. [2019-10-02 14:04:41,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:04:41,812 INFO L93 Difference]: Finished difference Result 1221 states and 1603 transitions. [2019-10-02 14:04:41,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:04:41,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-10-02 14:04:41,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:04:41,823 INFO L225 Difference]: With dead ends: 1221 [2019-10-02 14:04:41,823 INFO L226 Difference]: Without dead ends: 787 [2019-10-02 14:04:41,829 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:04:41,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-10-02 14:04:41,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 786. [2019-10-02 14:04:41,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2019-10-02 14:04:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1044 transitions. [2019-10-02 14:04:41,881 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1044 transitions. Word has length 222 [2019-10-02 14:04:41,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:04:41,882 INFO L475 AbstractCegarLoop]: Abstraction has 786 states and 1044 transitions. [2019-10-02 14:04:41,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:04:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1044 transitions. [2019-10-02 14:04:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 14:04:41,889 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:04:41,890 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:04:41,890 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:04:41,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:04:41,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1749524217, now seen corresponding path program 1 times [2019-10-02 14:04:41,891 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:04:41,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:04:41,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:41,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:04:41,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:04:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 14:04:42,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:04:42,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:04:42,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:04:42,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:04:42,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:04:42,130 INFO L87 Difference]: Start difference. First operand 786 states and 1044 transitions. Second operand 3 states. [2019-10-02 14:04:42,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:04:42,210 INFO L93 Difference]: Finished difference Result 1510 states and 2044 transitions. [2019-10-02 14:04:42,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:04:42,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-10-02 14:04:42,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:04:42,272 INFO L225 Difference]: With dead ends: 1510 [2019-10-02 14:04:42,272 INFO L226 Difference]: Without dead ends: 841 [2019-10-02 14:04:42,275 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:04:42,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-10-02 14:04:42,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 840. [2019-10-02 14:04:42,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-10-02 14:04:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1132 transitions. [2019-10-02 14:04:42,318 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1132 transitions. Word has length 230 [2019-10-02 14:04:42,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:04:42,320 INFO L475 AbstractCegarLoop]: Abstraction has 840 states and 1132 transitions. [2019-10-02 14:04:42,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:04:42,320 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1132 transitions. [2019-10-02 14:04:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 14:04:42,325 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:04:42,325 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:04:42,326 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:04:42,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:04:42,326 INFO L82 PathProgramCache]: Analyzing trace with hash -377999714, now seen corresponding path program 1 times [2019-10-02 14:04:42,326 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:04:42,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:04:42,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:42,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:04:42,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:04:42,660 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-02 14:04:42,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:04:42,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:04:42,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:04:42,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:04:42,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:04:42,664 INFO L87 Difference]: Start difference. First operand 840 states and 1132 transitions. Second operand 3 states. [2019-10-02 14:04:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:04:42,740 INFO L93 Difference]: Finished difference Result 1413 states and 1904 transitions. [2019-10-02 14:04:42,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:04:42,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-10-02 14:04:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:04:42,758 INFO L225 Difference]: With dead ends: 1413 [2019-10-02 14:04:42,758 INFO L226 Difference]: Without dead ends: 992 [2019-10-02 14:04:42,761 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:04:42,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-10-02 14:04:42,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 991. [2019-10-02 14:04:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-10-02 14:04:42,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1343 transitions. [2019-10-02 14:04:42,833 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1343 transitions. Word has length 231 [2019-10-02 14:04:42,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:04:42,837 INFO L475 AbstractCegarLoop]: Abstraction has 991 states and 1343 transitions. [2019-10-02 14:04:42,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:04:42,837 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1343 transitions. [2019-10-02 14:04:42,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-10-02 14:04:42,853 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:04:42,854 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:04:42,854 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:04:42,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:04:42,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1431521957, now seen corresponding path program 1 times [2019-10-02 14:04:42,855 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:04:42,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:04:42,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:42,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:04:42,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:04:43,328 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-02 14:04:43,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:04:43,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:04:43,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:04:43,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:04:43,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:04:43,330 INFO L87 Difference]: Start difference. First operand 991 states and 1343 transitions. Second operand 6 states. [2019-10-02 14:04:44,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:04:44,203 INFO L93 Difference]: Finished difference Result 2407 states and 3264 transitions. [2019-10-02 14:04:44,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:04:44,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 378 [2019-10-02 14:04:44,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:04:44,215 INFO L225 Difference]: With dead ends: 2407 [2019-10-02 14:04:44,215 INFO L226 Difference]: Without dead ends: 1881 [2019-10-02 14:04:44,219 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:04:44,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2019-10-02 14:04:44,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1870. [2019-10-02 14:04:44,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1870 states. [2019-10-02 14:04:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2561 transitions. [2019-10-02 14:04:44,314 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2561 transitions. Word has length 378 [2019-10-02 14:04:44,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:04:44,315 INFO L475 AbstractCegarLoop]: Abstraction has 1870 states and 2561 transitions. [2019-10-02 14:04:44,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:04:44,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2561 transitions. [2019-10-02 14:04:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-10-02 14:04:44,329 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:04:44,330 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:04:44,330 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:04:44,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:04:44,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1421916208, now seen corresponding path program 1 times [2019-10-02 14:04:44,331 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:04:44,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:04:44,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:44,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:04:44,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:04:44,852 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-02 14:04:44,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:04:44,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 14:04:44,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 14:04:44,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 14:04:44,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:04:44,854 INFO L87 Difference]: Start difference. First operand 1870 states and 2561 transitions. Second operand 13 states. [2019-10-02 14:04:45,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:04:45,447 INFO L93 Difference]: Finished difference Result 2973 states and 4015 transitions. [2019-10-02 14:04:45,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:04:45,447 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 379 [2019-10-02 14:04:45,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:04:45,462 INFO L225 Difference]: With dead ends: 2973 [2019-10-02 14:04:45,462 INFO L226 Difference]: Without dead ends: 1916 [2019-10-02 14:04:45,469 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:04:45,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2019-10-02 14:04:45,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1912. [2019-10-02 14:04:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1912 states. [2019-10-02 14:04:45,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2618 transitions. [2019-10-02 14:04:45,585 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2618 transitions. Word has length 379 [2019-10-02 14:04:45,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:04:45,585 INFO L475 AbstractCegarLoop]: Abstraction has 1912 states and 2618 transitions. [2019-10-02 14:04:45,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 14:04:45,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2618 transitions. [2019-10-02 14:04:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-10-02 14:04:45,599 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:04:45,599 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:04:45,599 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:04:45,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:04:45,600 INFO L82 PathProgramCache]: Analyzing trace with hash -2109443007, now seen corresponding path program 1 times [2019-10-02 14:04:45,600 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:04:45,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:04:45,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:45,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:04:45,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:04:45,937 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 14:04:45,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:04:45,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:04:45,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:04:45,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:04:45,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:04:45,939 INFO L87 Difference]: Start difference. First operand 1912 states and 2618 transitions. Second operand 3 states. [2019-10-02 14:04:46,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:04:46,145 INFO L93 Difference]: Finished difference Result 5430 states and 7564 transitions. [2019-10-02 14:04:46,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:04:46,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-10-02 14:04:46,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:04:46,169 INFO L225 Difference]: With dead ends: 5430 [2019-10-02 14:04:46,170 INFO L226 Difference]: Without dead ends: 3554 [2019-10-02 14:04:46,178 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:04:46,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2019-10-02 14:04:46,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3547. [2019-10-02 14:04:46,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3547 states. [2019-10-02 14:04:46,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 4907 transitions. [2019-10-02 14:04:46,352 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 4907 transitions. Word has length 392 [2019-10-02 14:04:46,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:04:46,353 INFO L475 AbstractCegarLoop]: Abstraction has 3547 states and 4907 transitions. [2019-10-02 14:04:46,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:04:46,353 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 4907 transitions. [2019-10-02 14:04:46,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-10-02 14:04:46,372 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:04:46,373 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:04:46,373 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:04:46,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:04:46,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1767957727, now seen corresponding path program 1 times [2019-10-02 14:04:46,373 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:04:46,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:04:46,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:46,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:04:46,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:04:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 14:04:46,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:04:46,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:04:46,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:04:46,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:04:46,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:04:46,751 INFO L87 Difference]: Start difference. First operand 3547 states and 4907 transitions. Second operand 3 states. [2019-10-02 14:04:47,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:04:47,052 INFO L93 Difference]: Finished difference Result 8601 states and 12117 transitions. [2019-10-02 14:04:47,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:04:47,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 394 [2019-10-02 14:04:47,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:04:47,083 INFO L225 Difference]: With dead ends: 8601 [2019-10-02 14:04:47,083 INFO L226 Difference]: Without dead ends: 5102 [2019-10-02 14:04:47,096 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:04:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5102 states. [2019-10-02 14:04:47,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5102 to 5099. [2019-10-02 14:04:47,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5099 states. [2019-10-02 14:04:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5099 states to 5099 states and 7066 transitions. [2019-10-02 14:04:47,352 INFO L78 Accepts]: Start accepts. Automaton has 5099 states and 7066 transitions. Word has length 394 [2019-10-02 14:04:47,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:04:47,353 INFO L475 AbstractCegarLoop]: Abstraction has 5099 states and 7066 transitions. [2019-10-02 14:04:47,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:04:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 5099 states and 7066 transitions. [2019-10-02 14:04:47,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-10-02 14:04:47,377 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:04:47,378 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:04:47,378 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:04:47,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:04:47,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1960027132, now seen corresponding path program 1 times [2019-10-02 14:04:47,379 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:04:47,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:04:47,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:47,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:04:47,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:04:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-10-02 14:04:48,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:04:48,026 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:04:48,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:04:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:04:48,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 4230 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:04:48,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:04:49,375 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-02 14:04:49,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:04:49,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [24] total 33 [2019-10-02 14:04:49,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 14:04:49,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 14:04:49,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 14:04:49,393 INFO L87 Difference]: Start difference. First operand 5099 states and 7066 transitions. Second operand 33 states. [2019-10-02 14:06:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:06:01,904 INFO L93 Difference]: Finished difference Result 35045 states and 52777 transitions. [2019-10-02 14:06:01,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2019-10-02 14:06:01,904 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 362 [2019-10-02 14:06:01,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:02,088 INFO L225 Difference]: With dead ends: 35045 [2019-10-02 14:06:02,088 INFO L226 Difference]: Without dead ends: 29824 [2019-10-02 14:06:02,140 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15308 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3152, Invalid=40320, Unknown=0, NotChecked=0, Total=43472 [2019-10-02 14:06:02,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29824 states. [2019-10-02 14:06:04,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29824 to 28554. [2019-10-02 14:06:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28554 states. [2019-10-02 14:06:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28554 states to 28554 states and 42330 transitions. [2019-10-02 14:06:04,286 INFO L78 Accepts]: Start accepts. Automaton has 28554 states and 42330 transitions. Word has length 362 [2019-10-02 14:06:04,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:06:04,287 INFO L475 AbstractCegarLoop]: Abstraction has 28554 states and 42330 transitions. [2019-10-02 14:06:04,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 14:06:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 28554 states and 42330 transitions. [2019-10-02 14:06:04,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-10-02 14:06:04,354 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:06:04,355 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:06:04,356 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:06:04,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:06:04,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1581746463, now seen corresponding path program 1 times [2019-10-02 14:06:04,356 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:06:04,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:06:04,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:04,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:04,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:04,960 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-10-02 14:06:04,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:06:04,961 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:06:05,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:06,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 4232 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:06:06,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:06:06,486 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-02 14:06:06,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:06:06,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [20] total 27 [2019-10-02 14:06:06,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 14:06:06,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 14:06:06,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:06:06,511 INFO L87 Difference]: Start difference. First operand 28554 states and 42330 transitions. Second operand 27 states. [2019-10-02 14:06:12,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:06:12,320 INFO L93 Difference]: Finished difference Result 58907 states and 91845 transitions. [2019-10-02 14:06:12,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 14:06:12,321 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 364 [2019-10-02 14:06:12,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:12,480 INFO L225 Difference]: With dead ends: 58907 [2019-10-02 14:06:12,480 INFO L226 Difference]: Without dead ends: 30468 [2019-10-02 14:06:12,597 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=175, Invalid=2375, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 14:06:12,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30468 states. [2019-10-02 14:06:14,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30468 to 30200. [2019-10-02 14:06:14,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30200 states. [2019-10-02 14:06:14,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30200 states to 30200 states and 45972 transitions. [2019-10-02 14:06:14,923 INFO L78 Accepts]: Start accepts. Automaton has 30200 states and 45972 transitions. Word has length 364 [2019-10-02 14:06:14,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:06:14,924 INFO L475 AbstractCegarLoop]: Abstraction has 30200 states and 45972 transitions. [2019-10-02 14:06:14,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 14:06:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 30200 states and 45972 transitions. [2019-10-02 14:06:14,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-10-02 14:06:14,996 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:06:14,997 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:06:14,997 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:06:14,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:06:14,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1280501848, now seen corresponding path program 1 times [2019-10-02 14:06:14,998 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:06:14,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:06:15,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:15,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:15,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:15,691 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-02 14:06:15,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:06:15,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:06:15,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:06:15,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:06:15,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:06:15,695 INFO L87 Difference]: Start difference. First operand 30200 states and 45972 transitions. Second operand 5 states. [2019-10-02 14:06:17,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:06:17,226 INFO L93 Difference]: Finished difference Result 54906 states and 82948 transitions. [2019-10-02 14:06:17,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:06:17,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 366 [2019-10-02 14:06:17,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:17,383 INFO L225 Difference]: With dead ends: 54906 [2019-10-02 14:06:17,383 INFO L226 Difference]: Without dead ends: 28898 [2019-10-02 14:06:17,479 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:06:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28898 states. [2019-10-02 14:06:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28898 to 28533. [2019-10-02 14:06:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28533 states. [2019-10-02 14:06:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28533 states to 28533 states and 42927 transitions. [2019-10-02 14:06:20,724 INFO L78 Accepts]: Start accepts. Automaton has 28533 states and 42927 transitions. Word has length 366 [2019-10-02 14:06:20,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:06:20,725 INFO L475 AbstractCegarLoop]: Abstraction has 28533 states and 42927 transitions. [2019-10-02 14:06:20,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:06:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 28533 states and 42927 transitions. [2019-10-02 14:06:20,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-10-02 14:06:20,778 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:06:20,779 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:06:20,779 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:06:20,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:06:20,780 INFO L82 PathProgramCache]: Analyzing trace with hash 852296598, now seen corresponding path program 1 times [2019-10-02 14:06:20,780 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:06:20,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:06:20,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:20,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:20,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-10-02 14:06:21,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:06:21,389 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:06:21,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:22,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 4233 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:06:22,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:06:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-10-02 14:06:22,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:06:22,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [20] total 29 [2019-10-02 14:06:22,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:06:22,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:06:22,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=749, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:06:22,509 INFO L87 Difference]: Start difference. First operand 28533 states and 42927 transitions. Second operand 29 states. [2019-10-02 14:07:30,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:07:30,336 INFO L93 Difference]: Finished difference Result 86072 states and 133421 transitions. [2019-10-02 14:07:30,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-10-02 14:07:30,337 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 365 [2019-10-02 14:07:30,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:07:30,574 INFO L225 Difference]: With dead ends: 86072 [2019-10-02 14:07:30,575 INFO L226 Difference]: Without dead ends: 49859 [2019-10-02 14:07:30,686 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14624 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2445, Invalid=38561, Unknown=0, NotChecked=0, Total=41006 [2019-10-02 14:07:30,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49859 states. [2019-10-02 14:07:33,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49859 to 45618. [2019-10-02 14:07:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45618 states. [2019-10-02 14:07:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45618 states to 45618 states and 68953 transitions. [2019-10-02 14:07:33,611 INFO L78 Accepts]: Start accepts. Automaton has 45618 states and 68953 transitions. Word has length 365 [2019-10-02 14:07:33,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:07:33,612 INFO L475 AbstractCegarLoop]: Abstraction has 45618 states and 68953 transitions. [2019-10-02 14:07:33,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:07:33,612 INFO L276 IsEmpty]: Start isEmpty. Operand 45618 states and 68953 transitions. [2019-10-02 14:07:33,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-10-02 14:07:33,647 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:07:33,647 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:07:33,648 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:07:33,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:07:33,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1943835174, now seen corresponding path program 1 times [2019-10-02 14:07:33,648 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:07:33,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:07:33,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:07:33,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:07:33,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:07:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:07:34,116 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-10-02 14:07:34,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:07:34,117 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:07:34,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:07:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:07:34,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 4235 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:07:34,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:07:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-10-02 14:07:35,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:07:35,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [20] total 29 [2019-10-02 14:07:35,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:07:35,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:07:35,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=749, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:07:35,478 INFO L87 Difference]: Start difference. First operand 45618 states and 68953 transitions. Second operand 29 states. [2019-10-02 14:08:47,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:08:47,929 INFO L93 Difference]: Finished difference Result 127624 states and 198077 transitions. [2019-10-02 14:08:47,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-10-02 14:08:47,929 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 367 [2019-10-02 14:08:47,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:08:48,295 INFO L225 Difference]: With dead ends: 127624 [2019-10-02 14:08:48,295 INFO L226 Difference]: Without dead ends: 67601 [2019-10-02 14:08:48,461 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14621 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2445, Invalid=38561, Unknown=0, NotChecked=0, Total=41006 [2019-10-02 14:08:48,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67601 states. [2019-10-02 14:08:50,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67601 to 59963. [2019-10-02 14:08:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59963 states. [2019-10-02 14:08:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59963 states to 59963 states and 90875 transitions. [2019-10-02 14:08:51,140 INFO L78 Accepts]: Start accepts. Automaton has 59963 states and 90875 transitions. Word has length 367 [2019-10-02 14:08:51,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:08:51,141 INFO L475 AbstractCegarLoop]: Abstraction has 59963 states and 90875 transitions. [2019-10-02 14:08:51,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:08:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand 59963 states and 90875 transitions. [2019-10-02 14:08:51,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-10-02 14:08:51,181 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:08:51,182 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:08:51,182 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:08:51,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:08:51,183 INFO L82 PathProgramCache]: Analyzing trace with hash 147815041, now seen corresponding path program 1 times [2019-10-02 14:08:51,183 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:08:51,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:08:51,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:51,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:51,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:51,577 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-02 14:08:51,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:08:51,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 14:08:51,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:08:51,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:08:51,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:08:51,579 INFO L87 Difference]: Start difference. First operand 59963 states and 90875 transitions. Second operand 11 states. [2019-10-02 14:09:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:09:02,636 INFO L93 Difference]: Finished difference Result 149586 states and 232386 transitions. [2019-10-02 14:09:02,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:09:02,637 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 368 [2019-10-02 14:09:02,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:09:03,239 INFO L225 Difference]: With dead ends: 149586 [2019-10-02 14:09:03,239 INFO L226 Difference]: Without dead ends: 94107 [2019-10-02 14:09:03,406 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:09:03,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94107 states. [2019-10-02 14:09:07,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94107 to 92586. [2019-10-02 14:09:07,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92586 states. [2019-10-02 14:09:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92586 states to 92586 states and 145021 transitions. [2019-10-02 14:09:07,447 INFO L78 Accepts]: Start accepts. Automaton has 92586 states and 145021 transitions. Word has length 368 [2019-10-02 14:09:07,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:09:07,448 INFO L475 AbstractCegarLoop]: Abstraction has 92586 states and 145021 transitions. [2019-10-02 14:09:07,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:09:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 92586 states and 145021 transitions. [2019-10-02 14:09:07,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-10-02 14:09:07,511 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:09:07,512 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:09:07,512 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:09:07,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:09:07,513 INFO L82 PathProgramCache]: Analyzing trace with hash 864911456, now seen corresponding path program 1 times [2019-10-02 14:09:07,513 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:09:07,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:09:07,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:07,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:09:07,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:09:08,529 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-10-02 14:09:08,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:09:08,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:09:08,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:09:08,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:09:08,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:09:08,531 INFO L87 Difference]: Start difference. First operand 92586 states and 145021 transitions. Second operand 3 states. [2019-10-02 14:09:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:09:11,668 INFO L93 Difference]: Finished difference Result 186102 states and 291772 transitions. [2019-10-02 14:09:11,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:09:11,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 419 [2019-10-02 14:09:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:09:12,267 INFO L225 Difference]: With dead ends: 186102 [2019-10-02 14:09:12,267 INFO L226 Difference]: Without dead ends: 93846 [2019-10-02 14:09:12,449 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:09:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93846 states. [2019-10-02 14:09:17,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93846 to 93834. [2019-10-02 14:09:17,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93834 states. [2019-10-02 14:09:17,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93834 states to 93834 states and 147091 transitions. [2019-10-02 14:09:17,833 INFO L78 Accepts]: Start accepts. Automaton has 93834 states and 147091 transitions. Word has length 419 [2019-10-02 14:09:17,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:09:17,833 INFO L475 AbstractCegarLoop]: Abstraction has 93834 states and 147091 transitions. [2019-10-02 14:09:17,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:09:17,833 INFO L276 IsEmpty]: Start isEmpty. Operand 93834 states and 147091 transitions. [2019-10-02 14:09:17,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-10-02 14:09:17,893 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:09:17,893 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:09:17,893 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:09:17,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:09:17,894 INFO L82 PathProgramCache]: Analyzing trace with hash 818158617, now seen corresponding path program 1 times [2019-10-02 14:09:17,894 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:09:17,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:09:17,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:17,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:09:17,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:09:18,146 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 14:09:18,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:09:18,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:09:18,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:09:18,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:09:18,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:09:18,149 INFO L87 Difference]: Start difference. First operand 93834 states and 147091 transitions. Second operand 3 states. [2019-10-02 14:09:24,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:09:24,807 INFO L93 Difference]: Finished difference Result 189750 states and 297862 transitions. [2019-10-02 14:09:24,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:09:24,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-10-02 14:09:24,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:09:25,418 INFO L225 Difference]: With dead ends: 189750 [2019-10-02 14:09:25,418 INFO L226 Difference]: Without dead ends: 96246 [2019-10-02 14:09:25,632 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:09:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96246 states. [2019-10-02 14:09:29,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96246 to 96234. [2019-10-02 14:09:29,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96234 states. [2019-10-02 14:09:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96234 states to 96234 states and 151087 transitions. [2019-10-02 14:09:30,373 INFO L78 Accepts]: Start accepts. Automaton has 96234 states and 151087 transitions. Word has length 418 [2019-10-02 14:09:30,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:09:30,373 INFO L475 AbstractCegarLoop]: Abstraction has 96234 states and 151087 transitions. [2019-10-02 14:09:30,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:09:30,373 INFO L276 IsEmpty]: Start isEmpty. Operand 96234 states and 151087 transitions. [2019-10-02 14:09:30,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-10-02 14:09:30,423 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:09:30,423 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:09:30,424 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:09:30,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:09:30,424 INFO L82 PathProgramCache]: Analyzing trace with hash -2107084596, now seen corresponding path program 1 times [2019-10-02 14:09:30,424 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:09:30,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:09:30,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:30,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:09:30,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:09:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 14:09:30,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:09:30,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:09:30,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:09:30,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:09:30,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:09:30,681 INFO L87 Difference]: Start difference. First operand 96234 states and 151087 transitions. Second operand 3 states. [2019-10-02 14:09:35,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:09:35,973 INFO L93 Difference]: Finished difference Result 196758 states and 309514 transitions. [2019-10-02 14:09:35,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:09:35,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 417 [2019-10-02 14:09:35,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:09:36,368 INFO L225 Difference]: With dead ends: 196758 [2019-10-02 14:09:36,368 INFO L226 Difference]: Without dead ends: 100854 [2019-10-02 14:09:36,531 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:09:36,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100854 states. [2019-10-02 14:09:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100854 to 100842. [2019-10-02 14:09:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100842 states. [2019-10-02 14:09:44,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100842 states to 100842 states and 158695 transitions. [2019-10-02 14:09:44,097 INFO L78 Accepts]: Start accepts. Automaton has 100842 states and 158695 transitions. Word has length 417 [2019-10-02 14:09:44,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:09:44,097 INFO L475 AbstractCegarLoop]: Abstraction has 100842 states and 158695 transitions. [2019-10-02 14:09:44,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:09:44,098 INFO L276 IsEmpty]: Start isEmpty. Operand 100842 states and 158695 transitions. [2019-10-02 14:09:44,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-10-02 14:09:44,148 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:09:44,148 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:09:44,148 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:09:44,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:09:44,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1987869528, now seen corresponding path program 1 times [2019-10-02 14:09:44,149 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:09:44,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:09:44,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:44,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:09:44,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:09:44,380 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 14:09:44,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:09:44,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:09:44,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:09:44,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:09:44,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:09:44,384 INFO L87 Difference]: Start difference. First operand 100842 states and 158695 transitions. Second operand 3 states. [2019-10-02 14:09:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:09:51,054 INFO L93 Difference]: Finished difference Result 210198 states and 331714 transitions. [2019-10-02 14:09:51,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:09:51,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 420 [2019-10-02 14:09:51,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:09:51,443 INFO L225 Difference]: With dead ends: 210198 [2019-10-02 14:09:51,444 INFO L226 Difference]: Without dead ends: 109686 [2019-10-02 14:09:51,607 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:09:51,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109686 states. [2019-10-02 14:09:55,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109686 to 109674. [2019-10-02 14:09:55,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109674 states. [2019-10-02 14:09:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109674 states to 109674 states and 173191 transitions. [2019-10-02 14:09:56,375 INFO L78 Accepts]: Start accepts. Automaton has 109674 states and 173191 transitions. Word has length 420 [2019-10-02 14:09:56,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:09:56,375 INFO L475 AbstractCegarLoop]: Abstraction has 109674 states and 173191 transitions. [2019-10-02 14:09:56,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:09:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 109674 states and 173191 transitions. [2019-10-02 14:09:56,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2019-10-02 14:09:56,461 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:09:56,462 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:09:56,462 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:09:56,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:09:56,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1388229768, now seen corresponding path program 1 times [2019-10-02 14:09:56,463 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:09:56,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:09:56,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:56,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:09:56,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:09:56,679 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-10-02 14:09:56,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:09:56,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:09:56,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:09:56,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:09:56,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:09:56,681 INFO L87 Difference]: Start difference. First operand 109674 states and 173191 transitions. Second operand 3 states. [2019-10-02 14:10:01,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:10:01,404 INFO L93 Difference]: Finished difference Result 235926 states and 373762 transitions. [2019-10-02 14:10:01,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:10:01,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 432 [2019-10-02 14:10:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:10:02,036 INFO L225 Difference]: With dead ends: 235926 [2019-10-02 14:10:02,036 INFO L226 Difference]: Without dead ends: 126582 [2019-10-02 14:10:06,912 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:10:07,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126582 states. [2019-10-02 14:10:11,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126582 to 126570. [2019-10-02 14:10:11,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126570 states. [2019-10-02 14:10:12,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126570 states to 126570 states and 200551 transitions. [2019-10-02 14:10:12,194 INFO L78 Accepts]: Start accepts. Automaton has 126570 states and 200551 transitions. Word has length 432 [2019-10-02 14:10:12,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:10:12,195 INFO L475 AbstractCegarLoop]: Abstraction has 126570 states and 200551 transitions. [2019-10-02 14:10:12,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:10:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 126570 states and 200551 transitions. [2019-10-02 14:10:12,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2019-10-02 14:10:12,339 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:10:12,340 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:10:12,340 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:10:12,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:10:12,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1666816051, now seen corresponding path program 1 times [2019-10-02 14:10:12,340 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:10:12,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:10:12,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:12,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:10:12,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:10:12,578 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-10-02 14:10:12,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:10:12,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:10:12,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:10:12,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:10:12,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:10:12,580 INFO L87 Difference]: Start difference. First operand 126570 states and 200551 transitions. Second operand 3 states. [2019-10-02 14:10:20,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:10:20,999 INFO L93 Difference]: Finished difference Result 285078 states and 453922 transitions. [2019-10-02 14:10:21,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:10:21,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 432 [2019-10-02 14:10:21,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:10:21,519 INFO L225 Difference]: With dead ends: 285078 [2019-10-02 14:10:21,519 INFO L226 Difference]: Without dead ends: 158838 [2019-10-02 14:10:21,716 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:10:21,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158838 states. [2019-10-02 14:10:28,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158838 to 158826. [2019-10-02 14:10:28,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158826 states. [2019-10-02 14:10:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158826 states to 158826 states and 252967 transitions. [2019-10-02 14:10:29,436 INFO L78 Accepts]: Start accepts. Automaton has 158826 states and 252967 transitions. Word has length 432 [2019-10-02 14:10:29,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:10:29,437 INFO L475 AbstractCegarLoop]: Abstraction has 158826 states and 252967 transitions. [2019-10-02 14:10:29,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:10:29,437 INFO L276 IsEmpty]: Start isEmpty. Operand 158826 states and 252967 transitions. [2019-10-02 14:10:29,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2019-10-02 14:10:29,749 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:10:29,749 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:10:29,749 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:10:29,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:10:29,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1238836167, now seen corresponding path program 1 times [2019-10-02 14:10:29,750 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:10:29,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:10:29,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:29,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:10:29,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:10:30,015 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-10-02 14:10:30,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:10:30,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:10:30,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:10:30,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:10:30,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:10:30,017 INFO L87 Difference]: Start difference. First operand 158826 states and 252967 transitions. Second operand 6 states. [2019-10-02 14:10:39,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:10:39,396 INFO L93 Difference]: Finished difference Result 317430 states and 508054 transitions. [2019-10-02 14:10:39,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 14:10:39,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 432 [2019-10-02 14:10:39,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:10:40,281 INFO L225 Difference]: With dead ends: 317430 [2019-10-02 14:10:40,281 INFO L226 Difference]: Without dead ends: 158934 [2019-10-02 14:10:40,470 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:10:40,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158934 states. [2019-10-02 14:10:50,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158934 to 158934. [2019-10-02 14:10:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158934 states. [2019-10-02 14:10:51,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158934 states to 158934 states and 253099 transitions. [2019-10-02 14:10:51,461 INFO L78 Accepts]: Start accepts. Automaton has 158934 states and 253099 transitions. Word has length 432 [2019-10-02 14:10:51,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:10:51,461 INFO L475 AbstractCegarLoop]: Abstraction has 158934 states and 253099 transitions. [2019-10-02 14:10:51,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:10:51,461 INFO L276 IsEmpty]: Start isEmpty. Operand 158934 states and 253099 transitions. [2019-10-02 14:10:51,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2019-10-02 14:10:51,753 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:10:51,754 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:10:51,754 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:10:51,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:10:51,754 INFO L82 PathProgramCache]: Analyzing trace with hash -172553268, now seen corresponding path program 1 times [2019-10-02 14:10:51,754 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:10:51,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:10:51,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:51,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:10:51,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:10:52,020 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-10-02 14:10:52,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:10:52,021 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:10:52,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:10:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:10:53,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 4599 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:10:53,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:10:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-02 14:10:53,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:10:53,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2019-10-02 14:10:53,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 14:10:53,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 14:10:53,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:10:53,471 INFO L87 Difference]: Start difference. First operand 158934 states and 253099 transitions. Second operand 13 states. [2019-10-02 14:11:01,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:01,927 INFO L93 Difference]: Finished difference Result 317608 states and 506489 transitions. [2019-10-02 14:11:01,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:11:01,928 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 432 [2019-10-02 14:11:01,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:02,478 INFO L225 Difference]: With dead ends: 317608 [2019-10-02 14:11:02,478 INFO L226 Difference]: Without dead ends: 158955 [2019-10-02 14:11:02,710 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:11:02,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158955 states. [2019-10-02 14:11:16,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158955 to 158955. [2019-10-02 14:11:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158955 states. [2019-10-02 14:11:16,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158955 states to 158955 states and 252262 transitions. [2019-10-02 14:11:16,932 INFO L78 Accepts]: Start accepts. Automaton has 158955 states and 252262 transitions. Word has length 432 [2019-10-02 14:11:16,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:16,933 INFO L475 AbstractCegarLoop]: Abstraction has 158955 states and 252262 transitions. [2019-10-02 14:11:16,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 14:11:16,933 INFO L276 IsEmpty]: Start isEmpty. Operand 158955 states and 252262 transitions. [2019-10-02 14:11:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2019-10-02 14:11:17,164 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:17,164 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:11:17,164 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:17,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:17,165 INFO L82 PathProgramCache]: Analyzing trace with hash 924882239, now seen corresponding path program 1 times [2019-10-02 14:11:17,165 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:17,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:17,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:17,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:17,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-10-02 14:11:17,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:11:17,466 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:11:17,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:18,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 4600 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:11:18,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:11:18,515 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-10-02 14:11:18,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:11:18,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2019-10-02 14:11:18,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 14:11:18,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 14:11:18,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-10-02 14:11:18,526 INFO L87 Difference]: Start difference. First operand 158955 states and 252262 transitions. Second operand 20 states. [2019-10-02 14:11:27,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:27,701 INFO L93 Difference]: Finished difference Result 318171 states and 505108 transitions. [2019-10-02 14:11:27,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 14:11:27,701 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 435 [2019-10-02 14:11:27,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:29,060 INFO L225 Difference]: With dead ends: 318171 [2019-10-02 14:11:29,060 INFO L226 Difference]: Without dead ends: 159317 [2019-10-02 14:11:29,281 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=1173, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 14:11:29,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159317 states. [2019-10-02 14:11:42,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159317 to 158889. [2019-10-02 14:11:42,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158889 states. [2019-10-02 14:11:43,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158889 states to 158889 states and 252112 transitions. [2019-10-02 14:11:43,185 INFO L78 Accepts]: Start accepts. Automaton has 158889 states and 252112 transitions. Word has length 435 [2019-10-02 14:11:43,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:43,185 INFO L475 AbstractCegarLoop]: Abstraction has 158889 states and 252112 transitions. [2019-10-02 14:11:43,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 14:11:43,186 INFO L276 IsEmpty]: Start isEmpty. Operand 158889 states and 252112 transitions. [2019-10-02 14:11:43,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-10-02 14:11:43,999 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:43,999 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:11:43,999 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:43,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:44,000 INFO L82 PathProgramCache]: Analyzing trace with hash 446562597, now seen corresponding path program 1 times [2019-10-02 14:11:44,000 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:44,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:44,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:44,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:44,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-02 14:11:44,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:11:44,436 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:11:44,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:45,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 4637 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:11:45,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:11:45,515 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2019-10-02 14:11:45,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:11:45,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 5] total 25 [2019-10-02 14:11:45,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 14:11:45,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 14:11:45,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:11:45,527 INFO L87 Difference]: Start difference. First operand 158889 states and 252112 transitions. Second operand 25 states. [2019-10-02 14:11:51,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:51,919 INFO L93 Difference]: Finished difference Result 251278 states and 396800 transitions. [2019-10-02 14:11:51,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 14:11:51,920 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 446 [2019-10-02 14:11:51,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:52,525 INFO L225 Difference]: With dead ends: 251278 [2019-10-02 14:11:52,526 INFO L226 Difference]: Without dead ends: 160763 [2019-10-02 14:11:52,722 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=1036, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:11:52,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160763 states. [2019-10-02 14:12:06,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160763 to 159873. [2019-10-02 14:12:06,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159873 states. [2019-10-02 14:12:06,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159873 states to 159873 states and 251690 transitions. [2019-10-02 14:12:06,425 INFO L78 Accepts]: Start accepts. Automaton has 159873 states and 251690 transitions. Word has length 446 [2019-10-02 14:12:06,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:12:06,426 INFO L475 AbstractCegarLoop]: Abstraction has 159873 states and 251690 transitions. [2019-10-02 14:12:06,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 14:12:06,426 INFO L276 IsEmpty]: Start isEmpty. Operand 159873 states and 251690 transitions. [2019-10-02 14:12:06,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-10-02 14:12:06,657 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:12:06,658 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:12:06,658 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:12:06,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:12:06,659 INFO L82 PathProgramCache]: Analyzing trace with hash -139229907, now seen corresponding path program 1 times [2019-10-02 14:12:06,659 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:12:06,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:12:06,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:06,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:12:06,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:12:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-02 14:12:06,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:12:06,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:12:06,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:12:06,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:12:06,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:12:06,874 INFO L87 Difference]: Start difference. First operand 159873 states and 251690 transitions. Second operand 5 states. [2019-10-02 14:12:13,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:12:13,276 INFO L93 Difference]: Finished difference Result 316836 states and 499161 transitions. [2019-10-02 14:12:13,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:12:13,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 445 [2019-10-02 14:12:13,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:12:13,817 INFO L225 Difference]: With dead ends: 316836 [2019-10-02 14:12:13,817 INFO L226 Difference]: Without dead ends: 159885 [2019-10-02 14:12:14,073 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:12:14,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159885 states. [2019-10-02 14:12:28,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159885 to 159873. [2019-10-02 14:12:28,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159873 states. [2019-10-02 14:12:29,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159873 states to 159873 states and 250919 transitions. [2019-10-02 14:12:29,208 INFO L78 Accepts]: Start accepts. Automaton has 159873 states and 250919 transitions. Word has length 445 [2019-10-02 14:12:29,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:12:29,209 INFO L475 AbstractCegarLoop]: Abstraction has 159873 states and 250919 transitions. [2019-10-02 14:12:29,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:12:29,209 INFO L276 IsEmpty]: Start isEmpty. Operand 159873 states and 250919 transitions. [2019-10-02 14:12:29,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2019-10-02 14:12:29,459 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:12:29,460 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:12:29,460 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:12:29,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:12:29,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1429646251, now seen corresponding path program 1 times [2019-10-02 14:12:29,461 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:12:29,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:12:29,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:29,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:12:29,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:12:29,713 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-10-02 14:12:29,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:12:29,714 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:12:29,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:12:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:12:30,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 4661 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:12:30,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:12:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2019-10-02 14:12:31,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:12:31,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2019-10-02 14:12:31,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:12:31,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:12:31,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:12:31,030 INFO L87 Difference]: Start difference. First operand 159873 states and 250919 transitions. Second operand 9 states. [2019-10-02 14:12:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:12:42,194 INFO L93 Difference]: Finished difference Result 406862 states and 664487 transitions. [2019-10-02 14:12:42,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:12:42,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 451 [2019-10-02 14:12:42,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:12:44,011 INFO L225 Difference]: With dead ends: 406862 [2019-10-02 14:12:44,011 INFO L226 Difference]: Without dead ends: 319868 [2019-10-02 14:12:44,200 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:12:44,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319868 states. [2019-10-02 14:13:07,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319868 to 319075. [2019-10-02 14:13:07,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319075 states. [2019-10-02 14:13:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319075 states to 319075 states and 522717 transitions. [2019-10-02 14:13:08,396 INFO L78 Accepts]: Start accepts. Automaton has 319075 states and 522717 transitions. Word has length 451 [2019-10-02 14:13:08,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:08,397 INFO L475 AbstractCegarLoop]: Abstraction has 319075 states and 522717 transitions. [2019-10-02 14:13:08,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:13:08,397 INFO L276 IsEmpty]: Start isEmpty. Operand 319075 states and 522717 transitions. [2019-10-02 14:13:08,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-10-02 14:13:08,859 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:08,859 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:08,860 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:08,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:08,860 INFO L82 PathProgramCache]: Analyzing trace with hash 688348555, now seen corresponding path program 1 times [2019-10-02 14:13:08,860 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:08,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:08,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:08,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:08,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:09,677 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-10-02 14:13:09,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:09,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:13:09,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:13:09,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:13:09,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:09,679 INFO L87 Difference]: Start difference. First operand 319075 states and 522717 transitions. Second operand 3 states. [2019-10-02 14:13:30,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:30,199 INFO L93 Difference]: Finished difference Result 723848 states and 1186637 transitions. [2019-10-02 14:13:30,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:13:30,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 442 [2019-10-02 14:13:30,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:32,764 INFO L225 Difference]: With dead ends: 723848 [2019-10-02 14:13:32,764 INFO L226 Difference]: Without dead ends: 415771 [2019-10-02 14:13:33,275 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:33,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415771 states. [2019-10-02 14:14:03,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415771 to 415720. [2019-10-02 14:14:03,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415720 states. [2019-10-02 14:14:15,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415720 states to 415720 states and 677862 transitions. [2019-10-02 14:14:15,816 INFO L78 Accepts]: Start accepts. Automaton has 415720 states and 677862 transitions. Word has length 442 [2019-10-02 14:14:15,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:15,816 INFO L475 AbstractCegarLoop]: Abstraction has 415720 states and 677862 transitions. [2019-10-02 14:14:15,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:14:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand 415720 states and 677862 transitions. [2019-10-02 14:14:16,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-10-02 14:14:16,736 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:16,737 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:14:16,737 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:16,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:16,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1243320549, now seen corresponding path program 1 times [2019-10-02 14:14:16,738 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:16,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:16,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:16,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:16,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:16,962 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-10-02 14:14:16,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:14:16,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:14:16,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:14:16,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:14:16,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:14:16,964 INFO L87 Difference]: Start difference. First operand 415720 states and 677862 transitions. Second operand 3 states. [2019-10-02 14:14:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:41,996 INFO L93 Difference]: Finished difference Result 999149 states and 1628957 transitions. [2019-10-02 14:14:41,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:14:41,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 444 [2019-10-02 14:14:41,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:44,130 INFO L225 Difference]: With dead ends: 999149 [2019-10-02 14:14:44,130 INFO L226 Difference]: Without dead ends: 597376 [2019-10-02 14:14:58,957 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:14:59,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597376 states.