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_spec27_product35.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:13:12,942 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:13:12,944 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:13:12,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:13:12,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:13:12,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:13:12,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:13:12,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:13:12,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:13:12,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:13:12,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:13:12,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:13:12,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:13:12,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:13:12,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:13:12,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:13:12,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:13:12,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:13:12,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:13:12,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:13:12,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:13:12,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:13:12,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:13:12,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:13:12,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:13:12,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:13:12,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:13:12,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:13:12,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:13:12,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:13:12,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:13:12,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:13:12,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:13:12,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:13:12,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:13:12,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:13:12,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:13:12,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:13:12,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:13:12,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:13:12,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:13:12,991 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 13:13:13,006 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:13:13,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:13:13,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:13:13,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:13:13,008 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:13:13,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:13:13,008 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:13:13,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:13:13,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:13:13,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:13:13,009 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:13:13,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:13:13,010 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:13:13,010 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:13:13,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:13:13,010 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:13:13,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:13:13,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:13:13,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:13:13,011 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:13:13,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:13:13,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:13:13,012 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:13:13,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:13:13,012 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:13:13,012 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:13:13,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:13:13,013 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:13:13,013 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:13:13,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:13:13,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:13:13,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:13:13,074 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:13:13,075 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:13:13,076 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec27_product35.cil.c [2019-10-02 13:13:13,150 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5b848b33/bd2640f23bd24c509479ad27d34cf755/FLAGa2d82b53d [2019-10-02 13:13:13,835 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:13:13,835 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec27_product35.cil.c [2019-10-02 13:13:13,857 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5b848b33/bd2640f23bd24c509479ad27d34cf755/FLAGa2d82b53d [2019-10-02 13:13:14,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5b848b33/bd2640f23bd24c509479ad27d34cf755 [2019-10-02 13:13:14,069 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:13:14,070 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:13:14,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:13:14,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:13:14,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:13:14,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:13:14" (1/1) ... [2019-10-02 13:13:14,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4819bea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:14, skipping insertion in model container [2019-10-02 13:13:14,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:13:14" (1/1) ... [2019-10-02 13:13:14,085 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:13:14,195 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:13:15,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:13:15,184 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:13:15,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:13:15,451 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:13:15,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:15 WrapperNode [2019-10-02 13:13:15,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:13:15,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:13:15,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:13:15,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:13:15,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:15" (1/1) ... [2019-10-02 13:13:15,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:15" (1/1) ... [2019-10-02 13:13:15,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:15" (1/1) ... [2019-10-02 13:13:15,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:15" (1/1) ... [2019-10-02 13:13:15,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:15" (1/1) ... [2019-10-02 13:13:15,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:15" (1/1) ... [2019-10-02 13:13:15,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:15" (1/1) ... [2019-10-02 13:13:15,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:13:15,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:13:15,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:13:15,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:13:15,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:13:15,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:13:15,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:13:15,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:13:15,727 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:13:15,728 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-10-02 13:13:15,728 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-10-02 13:13:15,729 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:13:15,729 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:13:15,729 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:13:15,729 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:13:15,729 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:13:15,730 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:13:15,730 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:13:15,731 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:13:15,732 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:13:15,732 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:13:15,734 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:13:15,734 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:13:15,735 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:13:15,735 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:13:15,735 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:13:15,735 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:13:15,735 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:13:15,736 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:13:15,736 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:13:15,737 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:13:15,737 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:13:15,737 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:13:15,737 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:13:15,737 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:13:15,737 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:13:15,738 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:13:15,738 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:13:15,738 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:13:15,738 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:13:15,738 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:13:15,738 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:13:15,738 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:13:15,739 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:13:15,739 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:13:15,739 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:13:15,739 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:13:15,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:13:15,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:13:15,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:13:15,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:13:15,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:13:15,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:13:15,741 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:13:15,741 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:13:15,741 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:13:15,741 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:13:15,741 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:13:15,741 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:13:15,741 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:13:15,742 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:13:15,742 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:13:15,742 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:13:15,742 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:13:15,742 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:13:15,742 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:13:15,742 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:13:15,743 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:13:15,743 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:13:15,743 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:13:15,744 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:13:15,744 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:13:15,744 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:13:15,744 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:13:15,745 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:13:15,745 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:13:15,745 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:13:15,745 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:13:15,745 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:13:15,746 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:13:15,746 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:13:15,746 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-10-02 13:13:15,746 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:13:15,746 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:13:15,747 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 13:13:15,747 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 13:13:15,747 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 13:13:15,748 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 13:13:15,748 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:13:15,748 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:13:15,748 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:13:15,748 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:13:15,749 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:13:15,749 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:13:15,749 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:13:15,750 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:13:15,750 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:13:15,750 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 13:13:15,750 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 13:13:15,751 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:13:15,751 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 13:13:15,751 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:13:15,751 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__VerifyForward_spec__1 [2019-10-02 13:13:15,751 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:13:15,751 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:13:15,751 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:13:15,752 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:13:15,752 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:13:15,752 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:13:15,752 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:13:15,752 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:13:15,752 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:13:15,752 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:13:15,753 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:13:15,753 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:13:15,753 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:13:15,753 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:13:15,753 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:13:15,753 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:13:15,754 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:13:15,754 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:13:15,754 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:13:15,755 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 13:13:15,755 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 13:13:15,755 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 13:13:15,755 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:13:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:13:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:13:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:13:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:13:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:13:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:13:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:13:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:13:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:13:15,759 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:13:15,759 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:13:15,759 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:13:15,760 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:13:15,760 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:13:15,760 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:13:15,760 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:13:15,760 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:13:15,761 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:13:15,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:13:15,765 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-10-02 13:13:15,766 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-10-02 13:13:15,766 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:13:15,767 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:13:15,772 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:13:15,773 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:13:15,773 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:13:15,773 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:13:15,773 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:13:15,773 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:13:15,774 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:13:15,774 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:13:15,774 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:13:15,774 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:13:15,774 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:13:15,775 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:13:15,775 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:13:15,775 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:13:15,776 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:13:15,777 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:13:15,777 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:13:15,777 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:13:15,777 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:13:15,777 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:13:15,777 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:13:15,778 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:13:15,778 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:13:15,778 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:13:15,778 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:13:15,778 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:13:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:13:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:13:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:13:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:13:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:13:15,780 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:13:15,780 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:13:15,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:13:15,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:13:15,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:13:15,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:13:15,781 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:13:15,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:13:15,781 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:13:15,781 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:13:15,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:13:15,782 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:13:15,782 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:13:15,782 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:13:15,782 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:13:15,782 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:13:15,782 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:13:15,783 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:13:15,783 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:13:15,783 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:13:15,783 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:13:15,783 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:13:15,783 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:13:15,784 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:13:15,784 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:13:15,784 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:13:15,784 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:13:15,784 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:13:15,784 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:13:15,785 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:13:15,785 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:13:15,785 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:13:15,785 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:13:15,785 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:13:15,785 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:13:15,786 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:13:15,786 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:13:15,786 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:13:15,786 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:13:15,786 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:13:15,786 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:13:15,786 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:13:15,787 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:13:15,787 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 13:13:15,787 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 13:13:15,787 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:13:15,787 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 13:13:15,787 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:13:15,788 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:13:15,788 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:13:15,788 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-10-02 13:13:15,788 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__VerifyForward_spec__1 [2019-10-02 13:13:15,788 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 13:13:15,789 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 13:13:15,789 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 13:13:15,789 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 13:13:15,789 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:13:15,789 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:13:15,789 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:13:15,789 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:13:15,790 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:13:15,790 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:13:15,790 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:13:15,790 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:13:15,790 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:13:15,791 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:13:15,791 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:13:15,791 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:13:15,791 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:13:15,791 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:13:15,791 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:13:15,791 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:13:15,792 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:13:15,792 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 13:13:15,792 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 13:13:15,792 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 13:13:15,792 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:13:15,792 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:13:15,793 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:13:15,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:13:15,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:13:15,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:13:18,166 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:13:18,167 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:13:18,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:13:18 BoogieIcfgContainer [2019-10-02 13:13:18,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:13:18,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:13:18,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:13:18,174 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:13:18,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:13:14" (1/3) ... [2019-10-02 13:13:18,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c55b8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:13:18, skipping insertion in model container [2019-10-02 13:13:18,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:15" (2/3) ... [2019-10-02 13:13:18,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c55b8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:13:18, skipping insertion in model container [2019-10-02 13:13:18,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:13:18" (3/3) ... [2019-10-02 13:13:18,183 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec27_product35.cil.c [2019-10-02 13:13:18,194 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:13:18,213 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:13:18,238 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:13:18,284 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:13:18,284 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:13:18,285 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:13:18,285 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:13:18,285 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:13:18,285 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:13:18,285 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:13:18,285 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:13:18,285 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:13:18,330 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states. [2019-10-02 13:13:18,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 13:13:18,369 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:18,372 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:18,376 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:18,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:18,384 INFO L82 PathProgramCache]: Analyzing trace with hash 6494718, now seen corresponding path program 1 times [2019-10-02 13:13:18,386 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:18,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:18,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:18,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:18,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:19,219 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:13:19,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:19,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:13:19,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:13:19,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:13:19,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:13:19,245 INFO L87 Difference]: Start difference. First operand 685 states. Second operand 2 states. [2019-10-02 13:13:19,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:19,353 INFO L93 Difference]: Finished difference Result 1045 states and 1413 transitions. [2019-10-02 13:13:19,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:13:19,355 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 222 [2019-10-02 13:13:19,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:19,396 INFO L225 Difference]: With dead ends: 1045 [2019-10-02 13:13:19,397 INFO L226 Difference]: Without dead ends: 656 [2019-10-02 13:13:19,409 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:13:19,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-10-02 13:13:19,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2019-10-02 13:13:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-10-02 13:13:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 889 transitions. [2019-10-02 13:13:19,519 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 889 transitions. Word has length 222 [2019-10-02 13:13:19,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:19,524 INFO L475 AbstractCegarLoop]: Abstraction has 656 states and 889 transitions. [2019-10-02 13:13:19,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:13:19,525 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 889 transitions. [2019-10-02 13:13:19,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-02 13:13:19,536 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:19,536 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:19,536 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:19,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:19,537 INFO L82 PathProgramCache]: Analyzing trace with hash -599466214, now seen corresponding path program 1 times [2019-10-02 13:13:19,537 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:19,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:19,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:19,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:19,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:19,846 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:13:19,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:19,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:13:19,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:13:19,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:13:19,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:19,855 INFO L87 Difference]: Start difference. First operand 656 states and 889 transitions. Second operand 3 states. [2019-10-02 13:13:19,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:19,978 INFO L93 Difference]: Finished difference Result 1028 states and 1372 transitions. [2019-10-02 13:13:19,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:13:19,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-10-02 13:13:19,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:19,988 INFO L225 Difference]: With dead ends: 1028 [2019-10-02 13:13:19,988 INFO L226 Difference]: Without dead ends: 659 [2019-10-02 13:13:19,993 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:20,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-10-02 13:13:20,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 658. [2019-10-02 13:13:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-10-02 13:13:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 891 transitions. [2019-10-02 13:13:20,070 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 891 transitions. Word has length 223 [2019-10-02 13:13:20,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:20,072 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 891 transitions. [2019-10-02 13:13:20,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:13:20,072 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 891 transitions. [2019-10-02 13:13:20,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 13:13:20,082 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:20,082 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:20,083 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:20,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:20,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1876117259, now seen corresponding path program 1 times [2019-10-02 13:13:20,083 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:20,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:20,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:20,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:20,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:20,318 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:13:20,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:20,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:13:20,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:13:20,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:13:20,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:20,323 INFO L87 Difference]: Start difference. First operand 658 states and 891 transitions. Second operand 3 states. [2019-10-02 13:13:20,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:20,379 INFO L93 Difference]: Finished difference Result 1296 states and 1786 transitions. [2019-10-02 13:13:20,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:13:20,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-10-02 13:13:20,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:20,391 INFO L225 Difference]: With dead ends: 1296 [2019-10-02 13:13:20,391 INFO L226 Difference]: Without dead ends: 703 [2019-10-02 13:13:20,395 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:20,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-10-02 13:13:20,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 702. [2019-10-02 13:13:20,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-10-02 13:13:20,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 966 transitions. [2019-10-02 13:13:20,451 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 966 transitions. Word has length 235 [2019-10-02 13:13:20,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:20,454 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 966 transitions. [2019-10-02 13:13:20,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:13:20,454 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 966 transitions. [2019-10-02 13:13:20,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 13:13:20,461 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:20,461 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:20,462 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:20,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:20,462 INFO L82 PathProgramCache]: Analyzing trace with hash 55549419, now seen corresponding path program 1 times [2019-10-02 13:13:20,463 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:20,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:20,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:20,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:20,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:20,724 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:13:20,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:20,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:13:20,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:13:20,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:13:20,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:20,728 INFO L87 Difference]: Start difference. First operand 702 states and 966 transitions. Second operand 3 states. [2019-10-02 13:13:20,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:20,819 INFO L93 Difference]: Finished difference Result 1425 states and 2006 transitions. [2019-10-02 13:13:20,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:13:20,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2019-10-02 13:13:20,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:20,825 INFO L225 Difference]: With dead ends: 1425 [2019-10-02 13:13:20,825 INFO L226 Difference]: Without dead ends: 788 [2019-10-02 13:13:20,828 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:20,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-10-02 13:13:20,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 787. [2019-10-02 13:13:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2019-10-02 13:13:20,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1110 transitions. [2019-10-02 13:13:20,861 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1110 transitions. Word has length 236 [2019-10-02 13:13:20,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:20,862 INFO L475 AbstractCegarLoop]: Abstraction has 787 states and 1110 transitions. [2019-10-02 13:13:20,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:13:20,862 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1110 transitions. [2019-10-02 13:13:20,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-02 13:13:20,867 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:20,868 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:20,868 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:20,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:20,868 INFO L82 PathProgramCache]: Analyzing trace with hash 339589291, now seen corresponding path program 1 times [2019-10-02 13:13:20,868 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:20,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:20,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:20,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:20,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:21,042 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:13:21,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:21,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:13:21,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:13:21,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:13:21,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:21,044 INFO L87 Difference]: Start difference. First operand 787 states and 1110 transitions. Second operand 3 states. [2019-10-02 13:13:21,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:21,086 INFO L93 Difference]: Finished difference Result 1674 states and 2428 transitions. [2019-10-02 13:13:21,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:13:21,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-10-02 13:13:21,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:21,092 INFO L225 Difference]: With dead ends: 1674 [2019-10-02 13:13:21,092 INFO L226 Difference]: Without dead ends: 952 [2019-10-02 13:13:21,095 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:21,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-10-02 13:13:21,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 951. [2019-10-02 13:13:21,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-10-02 13:13:21,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1386 transitions. [2019-10-02 13:13:21,135 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1386 transitions. Word has length 237 [2019-10-02 13:13:21,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:21,136 INFO L475 AbstractCegarLoop]: Abstraction has 951 states and 1386 transitions. [2019-10-02 13:13:21,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:13:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1386 transitions. [2019-10-02 13:13:21,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-02 13:13:21,142 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:21,143 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 13:13:21,143 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:21,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:21,143 INFO L82 PathProgramCache]: Analyzing trace with hash -2008576442, now seen corresponding path program 1 times [2019-10-02 13:13:21,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:21,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:21,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:21,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:21,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:21,617 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:13:21,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:13:21,618 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:13:21,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:22,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 3286 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:13:22,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:13:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-10-02 13:13:22,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:13:22,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2019-10-02 13:13:22,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:13:22,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:13:22,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:13:22,890 INFO L87 Difference]: Start difference. First operand 951 states and 1386 transitions. Second operand 26 states. [2019-10-02 13:13:34,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:34,278 INFO L93 Difference]: Finished difference Result 3576 states and 5255 transitions. [2019-10-02 13:13:34,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 13:13:34,288 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 239 [2019-10-02 13:13:34,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:34,306 INFO L225 Difference]: With dead ends: 3576 [2019-10-02 13:13:34,307 INFO L226 Difference]: Without dead ends: 2661 [2019-10-02 13:13:34,313 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=528, Invalid=5172, Unknown=0, NotChecked=0, Total=5700 [2019-10-02 13:13:34,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2019-10-02 13:13:34,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2624. [2019-10-02 13:13:34,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-10-02 13:13:34,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3825 transitions. [2019-10-02 13:13:34,471 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3825 transitions. Word has length 239 [2019-10-02 13:13:34,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:34,472 INFO L475 AbstractCegarLoop]: Abstraction has 2624 states and 3825 transitions. [2019-10-02 13:13:34,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:13:34,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3825 transitions. [2019-10-02 13:13:34,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-02 13:13:34,488 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:34,489 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:34,489 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:34,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:34,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1653199601, now seen corresponding path program 1 times [2019-10-02 13:13:34,490 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:34,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:34,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:34,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:34,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:13:34,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:13:34,900 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:13:35,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:35,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 3288 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:13:35,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:13:35,651 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream Closed [2019-10-02 13:13:35,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:13:35,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2019-10-02 13:13:35,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:13:35,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:13:35,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:13:35,670 INFO L87 Difference]: Start difference. First operand 2624 states and 3825 transitions. Second operand 18 states. [2019-10-02 13:13:37,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:37,992 INFO L93 Difference]: Finished difference Result 5351 states and 7898 transitions. [2019-10-02 13:13:37,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:13:37,993 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 241 [2019-10-02 13:13:37,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:38,012 INFO L225 Difference]: With dead ends: 5351 [2019-10-02 13:13:38,012 INFO L226 Difference]: Without dead ends: 2762 [2019-10-02 13:13:38,023 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 13:13:38,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2019-10-02 13:13:38,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2762. [2019-10-02 13:13:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2019-10-02 13:13:38,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 4051 transitions. [2019-10-02 13:13:38,158 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 4051 transitions. Word has length 241 [2019-10-02 13:13:38,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:38,158 INFO L475 AbstractCegarLoop]: Abstraction has 2762 states and 4051 transitions. [2019-10-02 13:13:38,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:13:38,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 4051 transitions. [2019-10-02 13:13:38,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-02 13:13:38,170 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:38,170 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:38,171 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:38,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:38,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1862616318, now seen corresponding path program 1 times [2019-10-02 13:13:38,172 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:38,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:38,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:38,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:38,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:38,502 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:13:38,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:13:38,502 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:13:38,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:39,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 3289 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:13:39,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:13:39,392 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:13:39,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:13:39,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 22 [2019-10-02 13:13:39,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 13:13:39,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 13:13:39,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:13:39,404 INFO L87 Difference]: Start difference. First operand 2762 states and 4051 transitions. Second operand 22 states. [2019-10-02 13:13:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:48,126 INFO L93 Difference]: Finished difference Result 5591 states and 8311 transitions. [2019-10-02 13:13:48,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 13:13:48,130 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 242 [2019-10-02 13:13:48,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:48,148 INFO L225 Difference]: With dead ends: 5591 [2019-10-02 13:13:48,148 INFO L226 Difference]: Without dead ends: 2890 [2019-10-02 13:13:48,160 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=464, Invalid=4228, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 13:13:48,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2019-10-02 13:13:48,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2853. [2019-10-02 13:13:48,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2853 states. [2019-10-02 13:13:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4203 transitions. [2019-10-02 13:13:48,306 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4203 transitions. Word has length 242 [2019-10-02 13:13:48,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:48,307 INFO L475 AbstractCegarLoop]: Abstraction has 2853 states and 4203 transitions. [2019-10-02 13:13:48,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 13:13:48,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4203 transitions. [2019-10-02 13:13:48,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-02 13:13:48,319 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:48,320 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:13:48,320 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:48,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:48,321 INFO L82 PathProgramCache]: Analyzing trace with hash 769886689, now seen corresponding path program 1 times [2019-10-02 13:13:48,321 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:48,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:48,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:48,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:48,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:13:48,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:48,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:13:48,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:13:48,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:13:48,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:13:48,807 INFO L87 Difference]: Start difference. First operand 2853 states and 4203 transitions. Second operand 18 states. [2019-10-02 13:13:49,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:49,510 INFO L93 Difference]: Finished difference Result 4546 states and 6571 transitions. [2019-10-02 13:13:49,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:13:49,511 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 243 [2019-10-02 13:13:49,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:49,533 INFO L225 Difference]: With dead ends: 4546 [2019-10-02 13:13:49,533 INFO L226 Difference]: Without dead ends: 2900 [2019-10-02 13:13:49,541 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:13:49,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2019-10-02 13:13:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 2898. [2019-10-02 13:13:49,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2019-10-02 13:13:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4242 transitions. [2019-10-02 13:13:49,745 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4242 transitions. Word has length 243 [2019-10-02 13:13:49,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:49,746 INFO L475 AbstractCegarLoop]: Abstraction has 2898 states and 4242 transitions. [2019-10-02 13:13:49,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:13:49,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4242 transitions. [2019-10-02 13:13:49,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-02 13:13:49,756 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:49,756 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:13:49,757 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:49,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:49,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1309740446, now seen corresponding path program 1 times [2019-10-02 13:13:49,757 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:49,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:49,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:49,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:49,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:49,976 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:13:49,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:13:49,976 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:13:50,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:50,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 3290 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:13:50,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:13:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:13:50,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:13:50,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-10-02 13:13:50,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:13:50,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:13:50,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:13:50,715 INFO L87 Difference]: Start difference. First operand 2898 states and 4242 transitions. Second operand 12 states. [2019-10-02 13:13:56,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:56,525 INFO L93 Difference]: Finished difference Result 8824 states and 13077 transitions. [2019-10-02 13:13:56,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 13:13:56,526 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 243 [2019-10-02 13:13:56,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:56,564 INFO L225 Difference]: With dead ends: 8824 [2019-10-02 13:13:56,564 INFO L226 Difference]: Without dead ends: 6001 [2019-10-02 13:13:56,580 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-10-02 13:13:56,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2019-10-02 13:13:56,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 5987. [2019-10-02 13:13:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5987 states. [2019-10-02 13:13:56,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5987 states to 5987 states and 8816 transitions. [2019-10-02 13:13:56,904 INFO L78 Accepts]: Start accepts. Automaton has 5987 states and 8816 transitions. Word has length 243 [2019-10-02 13:13:56,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:56,905 INFO L475 AbstractCegarLoop]: Abstraction has 5987 states and 8816 transitions. [2019-10-02 13:13:56,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:13:56,905 INFO L276 IsEmpty]: Start isEmpty. Operand 5987 states and 8816 transitions. [2019-10-02 13:13:56,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-02 13:13:56,921 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:56,921 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:13:56,922 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:56,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:56,922 INFO L82 PathProgramCache]: Analyzing trace with hash 623246346, now seen corresponding path program 1 times [2019-10-02 13:13:56,922 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:56,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:56,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:56,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:56,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:13:57,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:57,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:13:57,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:13:57,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:13:57,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:13:57,255 INFO L87 Difference]: Start difference. First operand 5987 states and 8816 transitions. Second operand 7 states. [2019-10-02 13:14:00,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:00,057 INFO L93 Difference]: Finished difference Result 18720 states and 29520 transitions. [2019-10-02 13:14:00,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:14:00,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 244 [2019-10-02 13:14:00,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:00,165 INFO L225 Difference]: With dead ends: 18720 [2019-10-02 13:14:00,165 INFO L226 Difference]: Without dead ends: 14529 [2019-10-02 13:14:00,194 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:14:00,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14529 states. [2019-10-02 13:14:00,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14529 to 14523. [2019-10-02 13:14:00,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14523 states. [2019-10-02 13:14:01,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14523 states to 14523 states and 22588 transitions. [2019-10-02 13:14:01,055 INFO L78 Accepts]: Start accepts. Automaton has 14523 states and 22588 transitions. Word has length 244 [2019-10-02 13:14:01,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:01,056 INFO L475 AbstractCegarLoop]: Abstraction has 14523 states and 22588 transitions. [2019-10-02 13:14:01,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:14:01,056 INFO L276 IsEmpty]: Start isEmpty. Operand 14523 states and 22588 transitions. [2019-10-02 13:14:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-02 13:14:01,075 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:01,075 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:14:01,075 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:01,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:01,076 INFO L82 PathProgramCache]: Analyzing trace with hash 329896570, now seen corresponding path program 1 times [2019-10-02 13:14:01,076 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:01,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:01,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:01,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:01,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:01,672 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:14:01,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:14:01,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 13:14:01,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:14:01,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:14:01,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:14:01,675 INFO L87 Difference]: Start difference. First operand 14523 states and 22588 transitions. Second operand 26 states. [2019-10-02 13:14:03,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:03,614 INFO L93 Difference]: Finished difference Result 27470 states and 43425 transitions. [2019-10-02 13:14:03,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 13:14:03,614 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 245 [2019-10-02 13:14:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:03,685 INFO L225 Difference]: With dead ends: 27470 [2019-10-02 13:14:03,685 INFO L226 Difference]: Without dead ends: 14743 [2019-10-02 13:14:03,729 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 13:14:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14743 states. [2019-10-02 13:14:04,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14743 to 14711. [2019-10-02 13:14:04,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14711 states. [2019-10-02 13:14:04,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14711 states to 14711 states and 22811 transitions. [2019-10-02 13:14:04,455 INFO L78 Accepts]: Start accepts. Automaton has 14711 states and 22811 transitions. Word has length 245 [2019-10-02 13:14:04,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:04,457 INFO L475 AbstractCegarLoop]: Abstraction has 14711 states and 22811 transitions. [2019-10-02 13:14:04,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:14:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 14711 states and 22811 transitions. [2019-10-02 13:14:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-02 13:14:04,476 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:04,477 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:14:04,477 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:04,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:04,478 INFO L82 PathProgramCache]: Analyzing trace with hash 211817539, now seen corresponding path program 1 times [2019-10-02 13:14:04,478 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:04,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:04,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:04,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:04,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:14:04,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:14:04,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 13:14:04,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 13:14:04,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 13:14:04,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:14:04,688 INFO L87 Difference]: Start difference. First operand 14711 states and 22811 transitions. Second operand 10 states. [2019-10-02 13:14:05,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:05,279 INFO L93 Difference]: Finished difference Result 27836 states and 44548 transitions. [2019-10-02 13:14:05,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:14:05,280 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 249 [2019-10-02 13:14:05,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:05,370 INFO L225 Difference]: With dead ends: 27836 [2019-10-02 13:14:05,370 INFO L226 Difference]: Without dead ends: 15311 [2019-10-02 13:14:05,407 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:14:05,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15311 states. [2019-10-02 13:14:06,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15311 to 14831. [2019-10-02 13:14:06,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14831 states. [2019-10-02 13:14:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14831 states to 14831 states and 22951 transitions. [2019-10-02 13:14:06,219 INFO L78 Accepts]: Start accepts. Automaton has 14831 states and 22951 transitions. Word has length 249 [2019-10-02 13:14:06,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:06,220 INFO L475 AbstractCegarLoop]: Abstraction has 14831 states and 22951 transitions. [2019-10-02 13:14:06,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 13:14:06,220 INFO L276 IsEmpty]: Start isEmpty. Operand 14831 states and 22951 transitions. [2019-10-02 13:14:06,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-02 13:14:06,250 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:06,250 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:14:06,251 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:06,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:06,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1731996071, now seen corresponding path program 1 times [2019-10-02 13:14:06,251 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:06,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:06,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:06,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:06,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:14:06,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:14:06,412 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:14:06,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:07,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 3333 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:14:07,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:14:07,324 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:14:07,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:14:07,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-10-02 13:14:07,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 13:14:07,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 13:14:07,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:14:07,333 INFO L87 Difference]: Start difference. First operand 14831 states and 22951 transitions. Second operand 10 states. [2019-10-02 13:14:09,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:09,074 INFO L93 Difference]: Finished difference Result 29909 states and 47229 transitions. [2019-10-02 13:14:09,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:14:09,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 254 [2019-10-02 13:14:09,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:09,151 INFO L225 Difference]: With dead ends: 29909 [2019-10-02 13:14:09,151 INFO L226 Difference]: Without dead ends: 15158 [2019-10-02 13:14:09,192 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-10-02 13:14:09,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15158 states. [2019-10-02 13:14:10,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15158 to 14977. [2019-10-02 13:14:10,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14977 states. [2019-10-02 13:14:10,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14977 states to 14977 states and 23171 transitions. [2019-10-02 13:14:10,865 INFO L78 Accepts]: Start accepts. Automaton has 14977 states and 23171 transitions. Word has length 254 [2019-10-02 13:14:10,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:10,866 INFO L475 AbstractCegarLoop]: Abstraction has 14977 states and 23171 transitions. [2019-10-02 13:14:10,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 13:14:10,866 INFO L276 IsEmpty]: Start isEmpty. Operand 14977 states and 23171 transitions. [2019-10-02 13:14:10,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-02 13:14:10,889 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:10,891 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:14:10,891 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:10,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:10,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1275824479, now seen corresponding path program 1 times [2019-10-02 13:14:10,891 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:10,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:10,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:10,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:10,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 13:14:11,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:14:11,072 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:14:11,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:11,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 3335 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:14:11,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:14:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:14:11,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:14:11,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-10-02 13:14:11,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:14:11,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:14:11,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:14:11,811 INFO L87 Difference]: Start difference. First operand 14977 states and 23171 transitions. Second operand 11 states. [2019-10-02 13:14:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:15,658 INFO L93 Difference]: Finished difference Result 45005 states and 70969 transitions. [2019-10-02 13:14:15,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:14:15,659 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 256 [2019-10-02 13:14:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:15,813 INFO L225 Difference]: With dead ends: 45005 [2019-10-02 13:14:15,814 INFO L226 Difference]: Without dead ends: 30108 [2019-10-02 13:14:15,866 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:14:15,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30108 states. [2019-10-02 13:14:17,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30108 to 29682. [2019-10-02 13:14:17,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29682 states. [2019-10-02 13:14:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29682 states to 29682 states and 46038 transitions. [2019-10-02 13:14:17,539 INFO L78 Accepts]: Start accepts. Automaton has 29682 states and 46038 transitions. Word has length 256 [2019-10-02 13:14:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:17,540 INFO L475 AbstractCegarLoop]: Abstraction has 29682 states and 46038 transitions. [2019-10-02 13:14:17,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:14:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 29682 states and 46038 transitions. [2019-10-02 13:14:17,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-02 13:14:17,567 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:17,567 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:14:17,567 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:17,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:17,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1588192181, now seen corresponding path program 1 times [2019-10-02 13:14:17,568 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:17,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:17,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:17,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:17,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 13:14:17,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:14:17,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:14:17,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:14:17,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:14:17,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:14:17,813 INFO L87 Difference]: Start difference. First operand 29682 states and 46038 transitions. Second operand 7 states. [2019-10-02 13:14:23,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:23,931 INFO L93 Difference]: Finished difference Result 84716 states and 141258 transitions. [2019-10-02 13:14:23,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:14:23,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 258 [2019-10-02 13:14:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:24,267 INFO L225 Difference]: With dead ends: 84716 [2019-10-02 13:14:24,267 INFO L226 Difference]: Without dead ends: 58539 [2019-10-02 13:14:24,350 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:14:24,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58539 states. [2019-10-02 13:14:28,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58539 to 58032. [2019-10-02 13:14:28,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58032 states. [2019-10-02 13:14:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58032 states to 58032 states and 96030 transitions. [2019-10-02 13:14:28,578 INFO L78 Accepts]: Start accepts. Automaton has 58032 states and 96030 transitions. Word has length 258 [2019-10-02 13:14:28,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:28,579 INFO L475 AbstractCegarLoop]: Abstraction has 58032 states and 96030 transitions. [2019-10-02 13:14:28,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:14:28,579 INFO L276 IsEmpty]: Start isEmpty. Operand 58032 states and 96030 transitions. [2019-10-02 13:14:28,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-02 13:14:28,599 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:28,600 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:14:28,600 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:28,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:28,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1873896386, now seen corresponding path program 1 times [2019-10-02 13:14:28,601 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:28,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:28,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:28,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:28,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 13:14:29,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:14:29,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2019-10-02 13:14:29,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 13:14:29,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 13:14:29,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-10-02 13:14:29,205 INFO L87 Difference]: Start difference. First operand 58032 states and 96030 transitions. Second operand 32 states. [2019-10-02 13:14:32,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:32,409 INFO L93 Difference]: Finished difference Result 115592 states and 195209 transitions. [2019-10-02 13:14:32,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 13:14:32,410 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 259 [2019-10-02 13:14:32,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:32,688 INFO L225 Difference]: With dead ends: 115592 [2019-10-02 13:14:32,688 INFO L226 Difference]: Without dead ends: 61065 [2019-10-02 13:14:32,841 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=1953, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 13:14:32,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61065 states. [2019-10-02 13:14:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61065 to 60984. [2019-10-02 13:14:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60984 states. [2019-10-02 13:14:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60984 states to 60984 states and 100082 transitions. [2019-10-02 13:14:37,563 INFO L78 Accepts]: Start accepts. Automaton has 60984 states and 100082 transitions. Word has length 259 [2019-10-02 13:14:37,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:37,564 INFO L475 AbstractCegarLoop]: Abstraction has 60984 states and 100082 transitions. [2019-10-02 13:14:37,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 13:14:37,564 INFO L276 IsEmpty]: Start isEmpty. Operand 60984 states and 100082 transitions. [2019-10-02 13:14:37,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-10-02 13:14:37,594 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:37,595 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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 13:14:37,595 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:37,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:37,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1640797640, now seen corresponding path program 1 times [2019-10-02 13:14:37,596 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:37,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:37,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:37,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:37,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 13:14:37,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:14:37,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:14:37,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:14:37,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:14:37,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:14:37,862 INFO L87 Difference]: Start difference. First operand 60984 states and 100082 transitions. Second operand 8 states. [2019-10-02 13:14:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:51,546 INFO L93 Difference]: Finished difference Result 239349 states and 441538 transitions. [2019-10-02 13:14:51,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:14:51,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 290 [2019-10-02 13:14:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:52,283 INFO L225 Difference]: With dead ends: 239349 [2019-10-02 13:14:52,283 INFO L226 Difference]: Without dead ends: 181870 [2019-10-02 13:14:52,469 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:14:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181870 states. [2019-10-02 13:15:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181870 to 181624. [2019-10-02 13:15:02,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181624 states. [2019-10-02 13:15:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181624 states to 181624 states and 322746 transitions. [2019-10-02 13:15:08,433 INFO L78 Accepts]: Start accepts. Automaton has 181624 states and 322746 transitions. Word has length 290 [2019-10-02 13:15:08,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:15:08,434 INFO L475 AbstractCegarLoop]: Abstraction has 181624 states and 322746 transitions. [2019-10-02 13:15:08,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:15:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand 181624 states and 322746 transitions. [2019-10-02 13:15:08,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-10-02 13:15:08,506 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:15:08,506 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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 13:15:08,507 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:15:08,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:15:08,507 INFO L82 PathProgramCache]: Analyzing trace with hash 286827746, now seen corresponding path program 1 times [2019-10-02 13:15:08,507 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:15:08,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:15:08,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:08,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:15:08,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:15:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 13:15:08,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:15:08,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 13:15:09,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 13:15:09,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 13:15:09,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-10-02 13:15:09,003 INFO L87 Difference]: Start difference. First operand 181624 states and 322746 transitions. Second operand 24 states. [2019-10-02 13:15:15,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:15:15,759 INFO L93 Difference]: Finished difference Result 342837 states and 606810 transitions. [2019-10-02 13:15:15,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 13:15:15,759 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 291 [2019-10-02 13:15:15,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:15:16,492 INFO L225 Difference]: With dead ends: 342837 [2019-10-02 13:15:16,492 INFO L226 Difference]: Without dead ends: 168668 [2019-10-02 13:15:16,861 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 13:15:16,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168668 states. [2019-10-02 13:15:30,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168668 to 166537. [2019-10-02 13:15:30,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166537 states. [2019-10-02 13:15:30,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166537 states to 166537 states and 284597 transitions. [2019-10-02 13:15:30,767 INFO L78 Accepts]: Start accepts. Automaton has 166537 states and 284597 transitions. Word has length 291 [2019-10-02 13:15:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:15:30,768 INFO L475 AbstractCegarLoop]: Abstraction has 166537 states and 284597 transitions. [2019-10-02 13:15:30,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 13:15:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 166537 states and 284597 transitions. [2019-10-02 13:15:30,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-02 13:15:30,833 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:15:30,833 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:15:30,834 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:15:30,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:15:30,834 INFO L82 PathProgramCache]: Analyzing trace with hash 298253140, now seen corresponding path program 1 times [2019-10-02 13:15:30,834 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:15:30,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:15:30,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:30,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:15:30,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:15:31,040 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 13:15:31,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:15:31,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:15:31,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:15:31,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:15:31,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:15:31,042 INFO L87 Difference]: Start difference. First operand 166537 states and 284597 transitions. Second operand 8 states. [2019-10-02 13:15:49,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:15:49,675 INFO L93 Difference]: Finished difference Result 498530 states and 893682 transitions. [2019-10-02 13:15:49,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:15:49,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 300 [2019-10-02 13:15:49,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:15:51,153 INFO L225 Difference]: With dead ends: 498530 [2019-10-02 13:15:51,153 INFO L226 Difference]: Without dead ends: 342601 [2019-10-02 13:15:51,573 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:15:51,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342601 states. [2019-10-02 13:16:13,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342601 to 341962. [2019-10-02 13:16:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341962 states. [2019-10-02 13:16:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341962 states to 341962 states and 608512 transitions. [2019-10-02 13:16:15,383 INFO L78 Accepts]: Start accepts. Automaton has 341962 states and 608512 transitions. Word has length 300 [2019-10-02 13:16:15,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:16:15,383 INFO L475 AbstractCegarLoop]: Abstraction has 341962 states and 608512 transitions. [2019-10-02 13:16:15,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:16:15,383 INFO L276 IsEmpty]: Start isEmpty. Operand 341962 states and 608512 transitions. [2019-10-02 13:16:15,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-02 13:16:15,489 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:16:15,490 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:16:15,490 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:16:15,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:16:15,490 INFO L82 PathProgramCache]: Analyzing trace with hash 816441794, now seen corresponding path program 1 times [2019-10-02 13:16:15,490 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:16:15,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:16:15,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:16:15,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:16:15,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:16:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:16:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 13:16:15,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:16:15,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:16:15,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:16:15,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:16:15,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:16:15,665 INFO L87 Difference]: Start difference. First operand 341962 states and 608512 transitions. Second operand 5 states. [2019-10-02 13:16:41,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:16:41,293 INFO L93 Difference]: Finished difference Result 684161 states and 1299354 transitions. [2019-10-02 13:16:41,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:16:41,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 308 [2019-10-02 13:16:41,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:16:42,810 INFO L225 Difference]: With dead ends: 684161 [2019-10-02 13:16:42,810 INFO L226 Difference]: Without dead ends: 346986 [2019-10-02 13:16:43,571 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:16:44,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346986 states. [2019-10-02 13:17:10,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346986 to 346850. [2019-10-02 13:17:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346850 states. [2019-10-02 13:17:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346850 states to 346850 states and 614804 transitions. [2019-10-02 13:17:13,264 INFO L78 Accepts]: Start accepts. Automaton has 346850 states and 614804 transitions. Word has length 308 [2019-10-02 13:17:13,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:17:13,265 INFO L475 AbstractCegarLoop]: Abstraction has 346850 states and 614804 transitions. [2019-10-02 13:17:13,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:17:13,265 INFO L276 IsEmpty]: Start isEmpty. Operand 346850 states and 614804 transitions. [2019-10-02 13:17:13,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-02 13:17:13,371 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:17:13,372 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:17:13,372 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:17:13,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:17:13,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1803024483, now seen corresponding path program 1 times [2019-10-02 13:17:13,373 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:17:13,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:17:13,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:17:13,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:17:13,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:17:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:17:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-02 13:17:13,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:17:13,669 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:17:13,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:17:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:17:14,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 3505 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 13:17:14,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:17:14,483 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:17:14,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:17:14,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 4] total 17 [2019-10-02 13:17:14,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 13:17:14,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 13:17:14,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:17:14,501 INFO L87 Difference]: Start difference. First operand 346850 states and 614804 transitions. Second operand 17 states. [2019-10-02 13:17:49,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:17:49,171 INFO L93 Difference]: Finished difference Result 685265 states and 1275410 transitions. [2019-10-02 13:17:49,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-02 13:17:49,172 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 308 [2019-10-02 13:17:49,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:17:51,485 INFO L225 Difference]: With dead ends: 685265 [2019-10-02 13:17:51,485 INFO L226 Difference]: Without dead ends: 341620 [2019-10-02 13:17:52,242 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=254, Invalid=2398, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 13:17:52,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341620 states. [2019-10-02 13:18:07,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341620 to 334688. [2019-10-02 13:18:07,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334688 states. [2019-10-02 13:18:25,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334688 states to 334688 states and 574937 transitions. [2019-10-02 13:18:25,481 INFO L78 Accepts]: Start accepts. Automaton has 334688 states and 574937 transitions. Word has length 308 [2019-10-02 13:18:25,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:18:25,481 INFO L475 AbstractCegarLoop]: Abstraction has 334688 states and 574937 transitions. [2019-10-02 13:18:25,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 13:18:25,481 INFO L276 IsEmpty]: Start isEmpty. Operand 334688 states and 574937 transitions. [2019-10-02 13:18:25,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-02 13:18:25,588 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:18:25,588 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:18:25,588 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:18:25,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:18:25,589 INFO L82 PathProgramCache]: Analyzing trace with hash 23276699, now seen corresponding path program 1 times [2019-10-02 13:18:25,589 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:18:25,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:18:25,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:18:25,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:18:25,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:18:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:18:25,738 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:18:25,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:18:25,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:18:25,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:18:25,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:18:25,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:18:25,739 INFO L87 Difference]: Start difference. First operand 334688 states and 574937 transitions. Second operand 3 states. [2019-10-02 13:18:47,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:18:47,294 INFO L93 Difference]: Finished difference Result 671158 states and 1153281 transitions. [2019-10-02 13:18:47,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:18:47,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-10-02 13:18:47,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:18:49,895 INFO L225 Difference]: With dead ends: 671158 [2019-10-02 13:18:49,895 INFO L226 Difference]: Without dead ends: 336602 [2019-10-02 13:18:50,534 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:18:50,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336602 states. [2019-10-02 13:19:16,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336602 to 336596. [2019-10-02 13:19:16,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336596 states. [2019-10-02 13:19:19,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336596 states to 336596 states and 578452 transitions. [2019-10-02 13:19:19,793 INFO L78 Accepts]: Start accepts. Automaton has 336596 states and 578452 transitions. Word has length 300 [2019-10-02 13:19:19,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:19:19,793 INFO L475 AbstractCegarLoop]: Abstraction has 336596 states and 578452 transitions. [2019-10-02 13:19:19,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:19:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 336596 states and 578452 transitions. [2019-10-02 13:19:19,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-10-02 13:19:19,900 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:19:19,900 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:19:19,900 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:19:19,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:19:19,900 INFO L82 PathProgramCache]: Analyzing trace with hash -822487077, now seen corresponding path program 1 times [2019-10-02 13:19:19,900 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:19:19,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:19:19,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:19,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:19:19,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:19:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:19:20,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:19:20,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:19:20,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:19:20,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:19:20,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:19:20,054 INFO L87 Difference]: Start difference. First operand 336596 states and 578452 transitions. Second operand 3 states. [2019-10-02 13:19:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:19:42,305 INFO L93 Difference]: Finished difference Result 676705 states and 1163451 transitions. [2019-10-02 13:19:42,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:19:42,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-10-02 13:19:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:19:44,543 INFO L225 Difference]: With dead ends: 676705 [2019-10-02 13:19:44,544 INFO L226 Difference]: Without dead ends: 340262 [2019-10-02 13:19:45,230 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:19:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340262 states. [2019-10-02 13:20:09,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340262 to 340256. [2019-10-02 13:20:09,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340256 states. [2019-10-02 13:20:12,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340256 states to 340256 states and 585087 transitions. [2019-10-02 13:20:12,533 INFO L78 Accepts]: Start accepts. Automaton has 340256 states and 585087 transitions. Word has length 301 [2019-10-02 13:20:12,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:20:12,534 INFO L475 AbstractCegarLoop]: Abstraction has 340256 states and 585087 transitions. [2019-10-02 13:20:12,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:20:12,534 INFO L276 IsEmpty]: Start isEmpty. Operand 340256 states and 585087 transitions. [2019-10-02 13:20:12,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-10-02 13:20:12,653 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:12,653 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:20:12,653 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:12,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:12,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1633991941, now seen corresponding path program 1 times [2019-10-02 13:20:12,654 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:12,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:12,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:12,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:12,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:20:14,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:20:14,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:20:14,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:20:14,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:20:14,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:20:14,460 INFO L87 Difference]: Start difference. First operand 340256 states and 585087 transitions. Second operand 3 states. [2019-10-02 13:20:39,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:39,056 INFO L93 Difference]: Finished difference Result 687359 states and 1183029 transitions. [2019-10-02 13:20:39,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:20:39,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-10-02 13:20:39,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:40,782 INFO L225 Difference]: With dead ends: 687359 [2019-10-02 13:20:40,783 INFO L226 Difference]: Without dead ends: 347272 [2019-10-02 13:20:41,574 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:20:41,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347272 states. [2019-10-02 13:20:57,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347272 to 347266. [2019-10-02 13:20:57,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347266 states. [2019-10-02 13:20:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347266 states to 347266 states and 597952 transitions. [2019-10-02 13:20:59,949 INFO L78 Accepts]: Start accepts. Automaton has 347266 states and 597952 transitions. Word has length 302 [2019-10-02 13:20:59,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:20:59,949 INFO L475 AbstractCegarLoop]: Abstraction has 347266 states and 597952 transitions. [2019-10-02 13:20:59,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:20:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 347266 states and 597952 transitions. [2019-10-02 13:21:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-02 13:21:00,100 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:00,100 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:00,101 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:00,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:00,101 INFO L82 PathProgramCache]: Analyzing trace with hash 75841915, now seen corresponding path program 1 times [2019-10-02 13:21:00,101 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:00,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:00,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:00,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:00,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:09,977 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:21:09,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:09,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:21:09,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:21:09,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:21:09,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:21:09,979 INFO L87 Difference]: Start difference. First operand 347266 states and 597952 transitions. Second operand 3 states. [2019-10-02 13:21:23,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:23,657 INFO L93 Difference]: Finished difference Result 707805 states and 1220655 transitions. [2019-10-02 13:21:23,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:21:23,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-10-02 13:21:23,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:25,470 INFO L225 Difference]: With dead ends: 707805 [2019-10-02 13:21:25,470 INFO L226 Difference]: Without dead ends: 360714 [2019-10-02 13:21:27,019 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:21:27,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360714 states. [2019-10-02 13:21:53,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360714 to 360708. [2019-10-02 13:21:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360708 states. [2019-10-02 13:21:57,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360708 states to 360708 states and 622529 transitions. [2019-10-02 13:21:57,138 INFO L78 Accepts]: Start accepts. Automaton has 360708 states and 622529 transitions. Word has length 303 [2019-10-02 13:21:57,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:57,139 INFO L475 AbstractCegarLoop]: Abstraction has 360708 states and 622529 transitions. [2019-10-02 13:21:57,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:21:57,139 INFO L276 IsEmpty]: Start isEmpty. Operand 360708 states and 622529 transitions. [2019-10-02 13:21:57,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-10-02 13:21:57,364 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:57,364 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:57,365 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:57,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:57,365 INFO L82 PathProgramCache]: Analyzing trace with hash -640296613, now seen corresponding path program 1 times [2019-10-02 13:21:57,365 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:57,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:57,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:57,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:57,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:57,522 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:21:57,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:57,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:21:57,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:21:57,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:21:57,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:21:57,526 INFO L87 Difference]: Start difference. First operand 360708 states and 622529 transitions. Second operand 3 states. [2019-10-02 13:22:23,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:23,557 INFO L93 Difference]: Finished difference Result 746971 states and 1292457 transitions. [2019-10-02 13:22:23,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:22:23,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-10-02 13:22:23,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:25,242 INFO L225 Difference]: With dead ends: 746971 [2019-10-02 13:22:25,242 INFO L226 Difference]: Without dead ends: 386444 [2019-10-02 13:22:25,950 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:26,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386444 states. [2019-10-02 13:22:44,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386444 to 386438. [2019-10-02 13:22:44,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386438 states. [2019-10-02 13:22:47,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386438 states to 386438 states and 669378 transitions. [2019-10-02 13:22:47,417 INFO L78 Accepts]: Start accepts. Automaton has 386438 states and 669378 transitions. Word has length 304 [2019-10-02 13:22:47,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:47,418 INFO L475 AbstractCegarLoop]: Abstraction has 386438 states and 669378 transitions. [2019-10-02 13:22:47,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:22:47,418 INFO L276 IsEmpty]: Start isEmpty. Operand 386438 states and 669378 transitions. [2019-10-02 13:22:47,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-10-02 13:22:47,730 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:47,730 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:47,730 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:47,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:47,730 INFO L82 PathProgramCache]: Analyzing trace with hash -50648293, now seen corresponding path program 1 times [2019-10-02 13:22:47,731 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:47,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:47,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:47,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:47,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:22:58,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:58,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:22:58,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:22:58,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:22:58,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:58,769 INFO L87 Difference]: Start difference. First operand 386438 states and 669378 transitions. Second operand 3 states.