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_spec1_product21.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:53:09,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:53:09,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:53:09,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:53:09,132 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:53:09,132 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:53:09,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:53:09,135 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:53:09,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:53:09,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:53:09,139 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:53:09,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:53:09,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:53:09,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:53:09,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:53:09,148 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:53:09,149 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:53:09,150 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:53:09,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:53:09,160 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:53:09,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:53:09,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:53:09,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:53:09,170 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:53:09,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:53:09,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:53:09,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:53:09,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:53:09,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:53:09,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:53:09,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:53:09,179 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:53:09,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:53:09,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:53:09,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:53:09,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:53:09,183 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:53:09,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:53:09,184 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:53:09,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:53:09,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:53:09,189 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 12:53:09,206 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:53:09,206 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:53:09,207 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:53:09,208 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:53:09,208 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:53:09,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:53:09,208 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:53:09,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:53:09,209 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:53:09,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:53:09,209 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:53:09,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:53:09,209 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:53:09,210 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:53:09,210 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:53:09,210 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:53:09,210 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:53:09,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:53:09,211 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:53:09,211 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:53:09,211 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:53:09,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:53:09,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:53:09,212 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:53:09,212 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:53:09,212 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:53:09,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:53:09,212 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:53:09,212 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:53:09,242 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:53:09,262 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:53:09,266 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:53:09,267 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:53:09,267 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:53:09,268 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec1_product21.cil.c [2019-10-02 12:53:09,346 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9b476946/3267a64df7d84840817bc00015613592/FLAG488612a1d [2019-10-02 12:53:09,993 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:53:09,994 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product21.cil.c [2019-10-02 12:53:10,014 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9b476946/3267a64df7d84840817bc00015613592/FLAG488612a1d [2019-10-02 12:53:10,147 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9b476946/3267a64df7d84840817bc00015613592 [2019-10-02 12:53:10,158 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:53:10,160 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:53:10,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:53:10,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:53:10,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:53:10,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:53:10" (1/1) ... [2019-10-02 12:53:10,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1437ab1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:10, skipping insertion in model container [2019-10-02 12:53:10,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:53:10" (1/1) ... [2019-10-02 12:53:10,174 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:53:10,251 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:53:11,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:53:11,058 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:53:11,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:53:11,312 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:53:11,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:11 WrapperNode [2019-10-02 12:53:11,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:53:11,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:53:11,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:53:11,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:53:11,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:11" (1/1) ... [2019-10-02 12:53:11,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:11" (1/1) ... [2019-10-02 12:53:11,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:11" (1/1) ... [2019-10-02 12:53:11,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:11" (1/1) ... [2019-10-02 12:53:11,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:11" (1/1) ... [2019-10-02 12:53:11,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:11" (1/1) ... [2019-10-02 12:53:11,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:11" (1/1) ... [2019-10-02 12:53:11,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:53:11,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:53:11,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:53:11,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:53:11,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:11" (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 12:53:11,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:53:11,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:53:11,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:53:11,647 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 12:53:11,648 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 12:53:11,648 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 12:53:11,648 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 12:53:11,649 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 12:53:11,649 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 12:53:11,650 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 12:53:11,650 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 12:53:11,650 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 12:53:11,651 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 12:53:11,651 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 12:53:11,652 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 12:53:11,652 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 12:53:11,654 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 12:53:11,655 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 12:53:11,655 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 12:53:11,655 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 12:53:11,655 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 12:53:11,655 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 12:53:11,656 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 12:53:11,656 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 12:53:11,656 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 12:53:11,656 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:53:11,657 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 12:53:11,657 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 12:53:11,657 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 12:53:11,657 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 12:53:11,657 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 12:53:11,657 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 12:53:11,658 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 12:53:11,658 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:53:11,658 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:53:11,658 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:53:11,658 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:53:11,659 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:53:11,659 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:53:11,659 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:53:11,659 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:53:11,659 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:53:11,659 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:53:11,660 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 12:53:11,660 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 12:53:11,660 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-02 12:53:11,660 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 12:53:11,660 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 12:53:11,660 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-02 12:53:11,661 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 12:53:11,661 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 12:53:11,661 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 12:53:11,661 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 12:53:11,661 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 12:53:11,662 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 12:53:11,662 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 12:53:11,662 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 12:53:11,662 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 12:53:11,662 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 12:53:11,663 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 12:53:11,663 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 12:53:11,663 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 12:53:11,663 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 12:53:11,664 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 12:53:11,664 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 12:53:11,664 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 12:53:11,664 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 12:53:11,665 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 12:53:11,665 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 12:53:11,665 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 12:53:11,665 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 12:53:11,666 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 12:53:11,666 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 12:53:11,666 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 12:53:11,667 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 12:53:11,667 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 12:53:11,667 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 12:53:11,667 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 12:53:11,668 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 12:53:11,668 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 12:53:11,668 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 12:53:11,668 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 12:53:11,669 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 12:53:11,669 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 12:53:11,669 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 12:53:11,670 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 12:53:11,670 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 12:53:11,671 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 12:53:11,671 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 12:53:11,671 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 12:53:11,671 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 12:53:11,672 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 12:53:11,672 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 12:53:11,673 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 12:53:11,673 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 12:53:11,673 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 12:53:11,673 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 12:53:11,673 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 12:53:11,673 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:53:11,674 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:53:11,674 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 12:53:11,674 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 12:53:11,674 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 12:53:11,674 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 12:53:11,674 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 12:53:11,674 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 12:53:11,675 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 12:53:11,675 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 12:53:11,675 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 12:53:11,675 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 12:53:11,675 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 12:53:11,675 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:53:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:53:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:53:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:53:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 12:53:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 12:53:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 12:53:11,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:53:11,677 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 12:53:11,677 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 12:53:11,678 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 12:53:11,678 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 12:53:11,678 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 12:53:11,679 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 12:53:11,679 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 12:53:11,679 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 12:53:11,679 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 12:53:11,679 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 12:53:11,679 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 12:53:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 12:53:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 12:53:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 12:53:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 12:53:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 12:53:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 12:53:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 12:53:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 12:53:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 12:53:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 12:53:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 12:53:11,686 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 12:53:11,686 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 12:53:11,687 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 12:53:11,691 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 12:53:11,692 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 12:53:11,692 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 12:53:11,692 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 12:53:11,692 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 12:53:11,692 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:53:11,692 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:53:11,692 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 12:53:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 12:53:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 12:53:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 12:53:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 12:53:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 12:53:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 12:53:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:53:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:53:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:53:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:53:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:53:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:53:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:53:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:53:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:53:11,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:53:11,695 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:53:11,695 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:53:11,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:53:11,695 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:53:11,695 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:53:11,695 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:53:11,695 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:53:11,696 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:53:11,696 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:53:11,696 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:53:11,696 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 12:53:11,696 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 12:53:11,696 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 12:53:11,696 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 12:53:11,696 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 12:53:11,697 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 12:53:11,697 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 12:53:11,697 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 12:53:11,697 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 12:53:11,697 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 12:53:11,697 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 12:53:11,697 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 12:53:11,698 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 12:53:11,698 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 12:53:11,698 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 12:53:11,698 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 12:53:11,698 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 12:53:11,698 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 12:53:11,698 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 12:53:11,699 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 12:53:11,699 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 12:53:11,699 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 12:53:11,699 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 12:53:11,699 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-02 12:53:11,699 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-02 12:53:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 12:53:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 12:53:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 12:53:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 12:53:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 12:53:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 12:53:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 12:53:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 12:53:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 12:53:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 12:53:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 12:53:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 12:53:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 12:53:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 12:53:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 12:53:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 12:53:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 12:53:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 12:53:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 12:53:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 12:53:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 12:53:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 12:53:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 12:53:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 12:53:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 12:53:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 12:53:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:53:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:53:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 12:53:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 12:53:11,704 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 12:53:11,704 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 12:53:11,704 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 12:53:11,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:53:11,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:53:11,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:53:13,772 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:53:13,772 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 12:53:13,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:53:13 BoogieIcfgContainer [2019-10-02 12:53:13,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:53:13,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:53:13,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:53:13,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:53:13,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:53:10" (1/3) ... [2019-10-02 12:53:13,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b4ecec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:53:13, skipping insertion in model container [2019-10-02 12:53:13,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:11" (2/3) ... [2019-10-02 12:53:13,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b4ecec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:53:13, skipping insertion in model container [2019-10-02 12:53:13,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:53:13" (3/3) ... [2019-10-02 12:53:13,786 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec1_product21.cil.c [2019-10-02 12:53:13,797 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:53:13,812 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:53:13,830 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:53:13,886 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:53:13,887 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:53:13,887 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:53:13,887 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:53:13,888 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:53:13,888 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:53:13,888 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:53:13,888 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:53:13,888 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:53:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states. [2019-10-02 12:53:13,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 12:53:13,971 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:13,977 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:53:13,980 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:13,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:13,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1310424730, now seen corresponding path program 1 times [2019-10-02 12:53:13,990 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:13,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:14,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:14,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:14,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:53:14,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:14,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 12:53:14,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 12:53:14,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 12:53:14,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:53:14,685 INFO L87 Difference]: Start difference. First operand 569 states. Second operand 2 states. [2019-10-02 12:53:14,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:14,773 INFO L93 Difference]: Finished difference Result 824 states and 1118 transitions. [2019-10-02 12:53:14,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 12:53:14,775 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 154 [2019-10-02 12:53:14,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:14,817 INFO L225 Difference]: With dead ends: 824 [2019-10-02 12:53:14,817 INFO L226 Difference]: Without dead ends: 540 [2019-10-02 12:53:14,829 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 12:53:14,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-02 12:53:14,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-10-02 12:53:14,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-10-02 12:53:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 738 transitions. [2019-10-02 12:53:14,956 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 738 transitions. Word has length 154 [2019-10-02 12:53:14,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:14,959 INFO L475 AbstractCegarLoop]: Abstraction has 540 states and 738 transitions. [2019-10-02 12:53:14,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 12:53:14,959 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 738 transitions. [2019-10-02 12:53:14,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 12:53:14,964 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:14,964 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:53:14,965 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:14,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:14,965 INFO L82 PathProgramCache]: Analyzing trace with hash 684326183, now seen corresponding path program 1 times [2019-10-02 12:53:14,966 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:14,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:14,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:14,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:14,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:53:15,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:15,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:53:15,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:53:15,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:53:15,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:53:15,268 INFO L87 Difference]: Start difference. First operand 540 states and 738 transitions. Second operand 3 states. [2019-10-02 12:53:15,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:15,319 INFO L93 Difference]: Finished difference Result 807 states and 1084 transitions. [2019-10-02 12:53:15,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:53:15,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-02 12:53:15,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:15,325 INFO L225 Difference]: With dead ends: 807 [2019-10-02 12:53:15,325 INFO L226 Difference]: Without dead ends: 543 [2019-10-02 12:53:15,327 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 12:53:15,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-10-02 12:53:15,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 542. [2019-10-02 12:53:15,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-10-02 12:53:15,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 740 transitions. [2019-10-02 12:53:15,359 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 740 transitions. Word has length 155 [2019-10-02 12:53:15,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:15,360 INFO L475 AbstractCegarLoop]: Abstraction has 542 states and 740 transitions. [2019-10-02 12:53:15,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:53:15,360 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 740 transitions. [2019-10-02 12:53:15,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 12:53:15,363 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:15,364 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:53:15,364 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:15,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:15,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1057468101, now seen corresponding path program 1 times [2019-10-02 12:53:15,364 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:15,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:15,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:15,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:15,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:53:15,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:15,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:53:15,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:53:15,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:53:15,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:53:15,533 INFO L87 Difference]: Start difference. First operand 542 states and 740 transitions. Second operand 3 states. [2019-10-02 12:53:15,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:15,574 INFO L93 Difference]: Finished difference Result 1062 states and 1481 transitions. [2019-10-02 12:53:15,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:53:15,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-02 12:53:15,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:15,579 INFO L225 Difference]: With dead ends: 1062 [2019-10-02 12:53:15,579 INFO L226 Difference]: Without dead ends: 585 [2019-10-02 12:53:15,582 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 12:53:15,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-02 12:53:15,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 584. [2019-10-02 12:53:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-02 12:53:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 812 transitions. [2019-10-02 12:53:15,611 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 812 transitions. Word has length 161 [2019-10-02 12:53:15,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:15,611 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 812 transitions. [2019-10-02 12:53:15,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:53:15,612 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 812 transitions. [2019-10-02 12:53:15,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 12:53:15,616 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:15,616 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:53:15,617 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:15,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:15,617 INFO L82 PathProgramCache]: Analyzing trace with hash 521417968, now seen corresponding path program 1 times [2019-10-02 12:53:15,617 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:15,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:15,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:15,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:15,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 12:53:16,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:16,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-10-02 12:53:16,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 12:53:16,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 12:53:16,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=858, Unknown=0, NotChecked=0, Total=930 [2019-10-02 12:53:16,599 INFO L87 Difference]: Start difference. First operand 584 states and 812 transitions. Second operand 31 states. [2019-10-02 12:53:21,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:21,961 INFO L93 Difference]: Finished difference Result 1690 states and 2394 transitions. [2019-10-02 12:53:21,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 12:53:21,962 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 162 [2019-10-02 12:53:21,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:21,970 INFO L225 Difference]: With dead ends: 1690 [2019-10-02 12:53:21,970 INFO L226 Difference]: Without dead ends: 1142 [2019-10-02 12:53:21,973 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=252, Invalid=3054, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 12:53:21,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2019-10-02 12:53:22,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 853. [2019-10-02 12:53:22,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2019-10-02 12:53:22,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1240 transitions. [2019-10-02 12:53:22,023 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1240 transitions. Word has length 162 [2019-10-02 12:53:22,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:22,024 INFO L475 AbstractCegarLoop]: Abstraction has 853 states and 1240 transitions. [2019-10-02 12:53:22,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 12:53:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1240 transitions. [2019-10-02 12:53:22,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 12:53:22,028 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:22,029 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:53:22,029 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:22,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:22,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1681411932, now seen corresponding path program 1 times [2019-10-02 12:53:22,030 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:22,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:22,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:22,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:22,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:53:22,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:53:22,865 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 12:53:22,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:23,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 2641 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:53:23,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:53:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:53:23,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:53:23,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [31] total 35 [2019-10-02 12:53:23,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 12:53:23,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 12:53:23,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:53:23,670 INFO L87 Difference]: Start difference. First operand 853 states and 1240 transitions. Second operand 35 states. [2019-10-02 12:53:30,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:30,210 INFO L93 Difference]: Finished difference Result 1950 states and 2816 transitions. [2019-10-02 12:53:30,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 12:53:30,212 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 163 [2019-10-02 12:53:30,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:30,223 INFO L225 Difference]: With dead ends: 1950 [2019-10-02 12:53:30,224 INFO L226 Difference]: Without dead ends: 1148 [2019-10-02 12:53:30,228 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=295, Invalid=3865, Unknown=0, NotChecked=0, Total=4160 [2019-10-02 12:53:30,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-10-02 12:53:30,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 857. [2019-10-02 12:53:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2019-10-02 12:53:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1245 transitions. [2019-10-02 12:53:30,277 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1245 transitions. Word has length 163 [2019-10-02 12:53:30,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:30,277 INFO L475 AbstractCegarLoop]: Abstraction has 857 states and 1245 transitions. [2019-10-02 12:53:30,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 12:53:30,278 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1245 transitions. [2019-10-02 12:53:30,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 12:53:30,282 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:30,282 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:53:30,283 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:30,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:30,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1286349098, now seen corresponding path program 1 times [2019-10-02 12:53:30,283 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:30,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:30,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:30,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:30,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:30,970 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 12:53:30,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:30,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 12:53:30,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:53:30,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:53:30,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:53:30,973 INFO L87 Difference]: Start difference. First operand 857 states and 1245 transitions. Second operand 26 states. [2019-10-02 12:53:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:39,506 INFO L93 Difference]: Finished difference Result 2748 states and 3875 transitions. [2019-10-02 12:53:39,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 12:53:39,506 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 164 [2019-10-02 12:53:39,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:39,532 INFO L225 Difference]: With dead ends: 2748 [2019-10-02 12:53:39,532 INFO L226 Difference]: Without dead ends: 2493 [2019-10-02 12:53:39,540 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=724, Invalid=5596, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 12:53:39,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2019-10-02 12:53:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 1924. [2019-10-02 12:53:39,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2019-10-02 12:53:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2794 transitions. [2019-10-02 12:53:39,659 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2794 transitions. Word has length 164 [2019-10-02 12:53:39,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:39,660 INFO L475 AbstractCegarLoop]: Abstraction has 1924 states and 2794 transitions. [2019-10-02 12:53:39,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:53:39,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2794 transitions. [2019-10-02 12:53:39,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 12:53:39,668 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:39,668 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:53:39,669 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:39,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:39,669 INFO L82 PathProgramCache]: Analyzing trace with hash -780705449, now seen corresponding path program 1 times [2019-10-02 12:53:39,669 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:39,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:39,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:39,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:39,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:53:39,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:39,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:53:39,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:53:39,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:53:39,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:53:39,903 INFO L87 Difference]: Start difference. First operand 1924 states and 2794 transitions. Second operand 11 states. [2019-10-02 12:53:40,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:40,452 INFO L93 Difference]: Finished difference Result 2791 states and 3999 transitions. [2019-10-02 12:53:40,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:53:40,453 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 165 [2019-10-02 12:53:40,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:40,467 INFO L225 Difference]: With dead ends: 2791 [2019-10-02 12:53:40,467 INFO L226 Difference]: Without dead ends: 2023 [2019-10-02 12:53:40,471 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:53:40,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2019-10-02 12:53:40,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 2023. [2019-10-02 12:53:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2023 states. [2019-10-02 12:53:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 2951 transitions. [2019-10-02 12:53:40,585 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 2951 transitions. Word has length 165 [2019-10-02 12:53:40,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:40,586 INFO L475 AbstractCegarLoop]: Abstraction has 2023 states and 2951 transitions. [2019-10-02 12:53:40,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:53:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2951 transitions. [2019-10-02 12:53:40,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 12:53:40,594 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:40,594 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:53:40,595 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:40,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:40,595 INFO L82 PathProgramCache]: Analyzing trace with hash 2065662857, now seen corresponding path program 1 times [2019-10-02 12:53:40,595 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:40,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:40,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:40,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:40,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:40,784 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:53:40,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:40,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:53:40,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:53:40,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:53:40,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:53:40,786 INFO L87 Difference]: Start difference. First operand 2023 states and 2951 transitions. Second operand 5 states. [2019-10-02 12:53:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:41,961 INFO L93 Difference]: Finished difference Result 5085 states and 7290 transitions. [2019-10-02 12:53:41,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:53:41,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-10-02 12:53:41,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:41,995 INFO L225 Difference]: With dead ends: 5085 [2019-10-02 12:53:41,995 INFO L226 Difference]: Without dead ends: 4263 [2019-10-02 12:53:42,002 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:53:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4263 states. [2019-10-02 12:53:42,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4263 to 3992. [2019-10-02 12:53:42,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3992 states. [2019-10-02 12:53:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3992 states to 3992 states and 5715 transitions. [2019-10-02 12:53:42,298 INFO L78 Accepts]: Start accepts. Automaton has 3992 states and 5715 transitions. Word has length 165 [2019-10-02 12:53:42,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:42,301 INFO L475 AbstractCegarLoop]: Abstraction has 3992 states and 5715 transitions. [2019-10-02 12:53:42,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:53:42,301 INFO L276 IsEmpty]: Start isEmpty. Operand 3992 states and 5715 transitions. [2019-10-02 12:53:42,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 12:53:42,320 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:42,320 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:53:42,320 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:42,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:42,321 INFO L82 PathProgramCache]: Analyzing trace with hash 55559016, now seen corresponding path program 1 times [2019-10-02 12:53:42,321 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:42,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:42,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:42,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:42,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:42,550 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 12:53:42,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:42,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:53:42,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:53:42,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:53:42,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:53:42,553 INFO L87 Difference]: Start difference. First operand 3992 states and 5715 transitions. Second operand 9 states. [2019-10-02 12:53:42,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:42,877 INFO L93 Difference]: Finished difference Result 4555 states and 6460 transitions. [2019-10-02 12:53:42,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:53:42,878 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 165 [2019-10-02 12:53:42,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:42,887 INFO L225 Difference]: With dead ends: 4555 [2019-10-02 12:53:42,887 INFO L226 Difference]: Without dead ends: 1457 [2019-10-02 12:53:42,900 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:53:42,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2019-10-02 12:53:42,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1455. [2019-10-02 12:53:42,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1455 states. [2019-10-02 12:53:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 2040 transitions. [2019-10-02 12:53:42,978 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 2040 transitions. Word has length 165 [2019-10-02 12:53:42,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:42,981 INFO L475 AbstractCegarLoop]: Abstraction has 1455 states and 2040 transitions. [2019-10-02 12:53:42,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:53:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 2040 transitions. [2019-10-02 12:53:42,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 12:53:42,986 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:42,986 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:53:42,986 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:42,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:42,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1479457876, now seen corresponding path program 2 times [2019-10-02 12:53:42,987 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:42,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:42,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:42,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:42,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:53:43,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:43,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 12:53:43,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 12:53:43,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 12:53:43,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:53:43,500 INFO L87 Difference]: Start difference. First operand 1455 states and 2040 transitions. Second operand 24 states. [2019-10-02 12:53:52,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:52,213 INFO L93 Difference]: Finished difference Result 6236 states and 8837 transitions. [2019-10-02 12:53:52,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-02 12:53:52,214 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 165 [2019-10-02 12:53:52,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:52,243 INFO L225 Difference]: With dead ends: 6236 [2019-10-02 12:53:52,244 INFO L226 Difference]: Without dead ends: 5444 [2019-10-02 12:53:52,250 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1671 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=769, Invalid=5711, Unknown=0, NotChecked=0, Total=6480 [2019-10-02 12:53:52,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5444 states. [2019-10-02 12:53:52,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5444 to 3987. [2019-10-02 12:53:52,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3987 states. [2019-10-02 12:53:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3987 states to 3987 states and 5707 transitions. [2019-10-02 12:53:52,512 INFO L78 Accepts]: Start accepts. Automaton has 3987 states and 5707 transitions. Word has length 165 [2019-10-02 12:53:52,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:52,513 INFO L475 AbstractCegarLoop]: Abstraction has 3987 states and 5707 transitions. [2019-10-02 12:53:52,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 12:53:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3987 states and 5707 transitions. [2019-10-02 12:53:52,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 12:53:52,522 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:52,523 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:53:52,523 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:52,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:52,523 INFO L82 PathProgramCache]: Analyzing trace with hash -103770710, now seen corresponding path program 2 times [2019-10-02 12:53:52,524 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:52,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:52,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:52,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:53:52,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:52,661 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:53:52,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:52,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:53:52,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:53:52,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:53:52,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:53:52,663 INFO L87 Difference]: Start difference. First operand 3987 states and 5707 transitions. Second operand 7 states. [2019-10-02 12:53:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:52,923 INFO L93 Difference]: Finished difference Result 4550 states and 6452 transitions. [2019-10-02 12:53:52,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:53:52,924 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 166 [2019-10-02 12:53:52,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:52,932 INFO L225 Difference]: With dead ends: 4550 [2019-10-02 12:53:52,932 INFO L226 Difference]: Without dead ends: 1457 [2019-10-02 12:53:52,944 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:53:52,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2019-10-02 12:53:53,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1455. [2019-10-02 12:53:53,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1455 states. [2019-10-02 12:53:53,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 2039 transitions. [2019-10-02 12:53:53,033 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 2039 transitions. Word has length 166 [2019-10-02 12:53:53,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:53,033 INFO L475 AbstractCegarLoop]: Abstraction has 1455 states and 2039 transitions. [2019-10-02 12:53:53,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:53:53,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 2039 transitions. [2019-10-02 12:53:53,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 12:53:53,038 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:53,038 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:53:53,038 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:53,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:53,039 INFO L82 PathProgramCache]: Analyzing trace with hash -674522928, now seen corresponding path program 3 times [2019-10-02 12:53:53,039 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:53,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:53,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:53,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:53:53,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:53:53,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:53,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 12:53:53,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:53:53,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:53:53,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:53:53,521 INFO L87 Difference]: Start difference. First operand 1455 states and 2039 transitions. Second operand 26 states. [2019-10-02 12:54:01,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:01,593 INFO L93 Difference]: Finished difference Result 6243 states and 8844 transitions. [2019-10-02 12:54:01,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 12:54:01,593 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 166 [2019-10-02 12:54:01,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:01,624 INFO L225 Difference]: With dead ends: 6243 [2019-10-02 12:54:01,624 INFO L226 Difference]: Without dead ends: 5451 [2019-10-02 12:54:01,631 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1525 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=724, Invalid=5596, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 12:54:01,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5451 states. [2019-10-02 12:54:01,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5451 to 3992. [2019-10-02 12:54:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3992 states. [2019-10-02 12:54:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3992 states to 3992 states and 5712 transitions. [2019-10-02 12:54:01,885 INFO L78 Accepts]: Start accepts. Automaton has 3992 states and 5712 transitions. Word has length 166 [2019-10-02 12:54:01,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:01,887 INFO L475 AbstractCegarLoop]: Abstraction has 3992 states and 5712 transitions. [2019-10-02 12:54:01,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:54:01,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3992 states and 5712 transitions. [2019-10-02 12:54:01,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 12:54:01,897 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:01,898 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:54:01,898 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:01,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:01,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1842301102, now seen corresponding path program 3 times [2019-10-02 12:54:01,899 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:01,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:01,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:01,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:54:01,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:54:02,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:02,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:54:02,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:54:02,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:54:02,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:54:02,088 INFO L87 Difference]: Start difference. First operand 3992 states and 5712 transitions. Second operand 9 states. [2019-10-02 12:54:02,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:02,467 INFO L93 Difference]: Finished difference Result 4557 states and 6459 transitions. [2019-10-02 12:54:02,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:54:02,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-10-02 12:54:02,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:02,491 INFO L225 Difference]: With dead ends: 4557 [2019-10-02 12:54:02,492 INFO L226 Difference]: Without dead ends: 1459 [2019-10-02 12:54:02,505 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:54:02,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2019-10-02 12:54:02,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1455. [2019-10-02 12:54:02,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1455 states. [2019-10-02 12:54:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 2038 transitions. [2019-10-02 12:54:02,598 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 2038 transitions. Word has length 167 [2019-10-02 12:54:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:02,598 INFO L475 AbstractCegarLoop]: Abstraction has 1455 states and 2038 transitions. [2019-10-02 12:54:02,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:54:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 2038 transitions. [2019-10-02 12:54:02,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 12:54:02,605 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:02,606 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:02,606 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:02,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:02,607 INFO L82 PathProgramCache]: Analyzing trace with hash -2005101291, now seen corresponding path program 1 times [2019-10-02 12:54:02,607 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:02,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:02,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:02,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:54:02,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:03,176 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:54:03,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:03,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 12:54:03,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 12:54:03,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 12:54:03,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:54:03,179 INFO L87 Difference]: Start difference. First operand 1455 states and 2038 transitions. Second operand 24 states. [2019-10-02 12:54:11,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:11,983 INFO L93 Difference]: Finished difference Result 6824 states and 9767 transitions. [2019-10-02 12:54:11,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-02 12:54:11,984 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 167 [2019-10-02 12:54:11,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:12,017 INFO L225 Difference]: With dead ends: 6824 [2019-10-02 12:54:12,017 INFO L226 Difference]: Without dead ends: 5458 [2019-10-02 12:54:12,029 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=781, Invalid=5861, Unknown=0, NotChecked=0, Total=6642 [2019-10-02 12:54:12,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5458 states. [2019-10-02 12:54:12,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5458 to 3989. [2019-10-02 12:54:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3989 states. [2019-10-02 12:54:12,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3989 states to 3989 states and 5709 transitions. [2019-10-02 12:54:12,419 INFO L78 Accepts]: Start accepts. Automaton has 3989 states and 5709 transitions. Word has length 167 [2019-10-02 12:54:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:12,420 INFO L475 AbstractCegarLoop]: Abstraction has 3989 states and 5709 transitions. [2019-10-02 12:54:12,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 12:54:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3989 states and 5709 transitions. [2019-10-02 12:54:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 12:54:12,435 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:12,435 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:12,436 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:12,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:12,436 INFO L82 PathProgramCache]: Analyzing trace with hash -750922487, now seen corresponding path program 1 times [2019-10-02 12:54:12,436 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:12,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:12,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:12,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:12,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:54:12,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:12,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:54:12,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:54:12,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:54:12,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:54:12,668 INFO L87 Difference]: Start difference. First operand 3989 states and 5709 transitions. Second operand 7 states. [2019-10-02 12:54:13,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:13,026 INFO L93 Difference]: Finished difference Result 4556 states and 6459 transitions. [2019-10-02 12:54:13,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:54:13,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 168 [2019-10-02 12:54:13,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:13,044 INFO L225 Difference]: With dead ends: 4556 [2019-10-02 12:54:13,045 INFO L226 Difference]: Without dead ends: 1463 [2019-10-02 12:54:13,057 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:54:13,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2019-10-02 12:54:13,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1457. [2019-10-02 12:54:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2019-10-02 12:54:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 2041 transitions. [2019-10-02 12:54:13,198 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 2041 transitions. Word has length 168 [2019-10-02 12:54:13,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:13,198 INFO L475 AbstractCegarLoop]: Abstraction has 1457 states and 2041 transitions. [2019-10-02 12:54:13,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:54:13,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 2041 transitions. [2019-10-02 12:54:13,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 12:54:13,203 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:13,203 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:13,204 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:13,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:13,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1878162444, now seen corresponding path program 1 times [2019-10-02 12:54:13,204 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:13,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:13,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:13,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:13,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:54:13,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:13,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 12:54:13,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 12:54:13,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 12:54:13,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:54:13,510 INFO L87 Difference]: Start difference. First operand 1457 states and 2041 transitions. Second operand 18 states. [2019-10-02 12:54:17,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:17,960 INFO L93 Difference]: Finished difference Result 4008 states and 5640 transitions. [2019-10-02 12:54:17,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 12:54:17,960 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 168 [2019-10-02 12:54:17,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:17,974 INFO L225 Difference]: With dead ends: 4008 [2019-10-02 12:54:17,974 INFO L226 Difference]: Without dead ends: 3216 [2019-10-02 12:54:17,979 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1549, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 12:54:17,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3216 states. [2019-10-02 12:54:18,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3216 to 3175. [2019-10-02 12:54:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3175 states. [2019-10-02 12:54:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 4505 transitions. [2019-10-02 12:54:18,151 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 4505 transitions. Word has length 168 [2019-10-02 12:54:18,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:18,151 INFO L475 AbstractCegarLoop]: Abstraction has 3175 states and 4505 transitions. [2019-10-02 12:54:18,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 12:54:18,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 4505 transitions. [2019-10-02 12:54:18,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 12:54:18,158 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:18,159 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:18,159 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:18,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:18,159 INFO L82 PathProgramCache]: Analyzing trace with hash -566373637, now seen corresponding path program 1 times [2019-10-02 12:54:18,160 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:18,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:18,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:18,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:18,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:54:18,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:18,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:54:18,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:54:18,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:54:18,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:54:18,404 INFO L87 Difference]: Start difference. First operand 3175 states and 4505 transitions. Second operand 12 states. [2019-10-02 12:54:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:18,752 INFO L93 Difference]: Finished difference Result 5388 states and 7554 transitions. [2019-10-02 12:54:18,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:54:18,753 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 169 [2019-10-02 12:54:18,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:18,762 INFO L225 Difference]: With dead ends: 5388 [2019-10-02 12:54:18,763 INFO L226 Difference]: Without dead ends: 3164 [2019-10-02 12:54:18,771 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:54:18,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2019-10-02 12:54:18,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 3164. [2019-10-02 12:54:18,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3164 states. [2019-10-02 12:54:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3164 states to 3164 states and 4472 transitions. [2019-10-02 12:54:18,981 INFO L78 Accepts]: Start accepts. Automaton has 3164 states and 4472 transitions. Word has length 169 [2019-10-02 12:54:18,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:18,982 INFO L475 AbstractCegarLoop]: Abstraction has 3164 states and 4472 transitions. [2019-10-02 12:54:18,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:54:18,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3164 states and 4472 transitions. [2019-10-02 12:54:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 12:54:18,991 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:18,991 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:18,991 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:18,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:18,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1110785526, now seen corresponding path program 1 times [2019-10-02 12:54:18,992 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:18,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:18,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:18,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:18,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:19,187 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:54:19,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:19,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:54:19,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:54:19,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:54:19,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:54:19,190 INFO L87 Difference]: Start difference. First operand 3164 states and 4472 transitions. Second operand 9 states. [2019-10-02 12:54:19,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:19,607 INFO L93 Difference]: Finished difference Result 6257 states and 8862 transitions. [2019-10-02 12:54:19,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:54:19,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 169 [2019-10-02 12:54:19,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:19,620 INFO L225 Difference]: With dead ends: 6257 [2019-10-02 12:54:19,620 INFO L226 Difference]: Without dead ends: 3168 [2019-10-02 12:54:19,631 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:54:19,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3168 states. [2019-10-02 12:54:19,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3168 to 3164. [2019-10-02 12:54:19,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3164 states. [2019-10-02 12:54:19,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3164 states to 3164 states and 4471 transitions. [2019-10-02 12:54:19,837 INFO L78 Accepts]: Start accepts. Automaton has 3164 states and 4471 transitions. Word has length 169 [2019-10-02 12:54:19,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:19,838 INFO L475 AbstractCegarLoop]: Abstraction has 3164 states and 4471 transitions. [2019-10-02 12:54:19,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:54:19,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3164 states and 4471 transitions. [2019-10-02 12:54:19,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 12:54:19,844 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:19,845 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:19,845 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:19,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:19,845 INFO L82 PathProgramCache]: Analyzing trace with hash 196356872, now seen corresponding path program 1 times [2019-10-02 12:54:19,846 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:19,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:19,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:19,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:19,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:19,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:54:19,972 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 12:54:20,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:20,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 2646 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:54:20,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:54:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:20,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:54:20,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 12:54:20,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:54:20,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:54:20,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:54:20,616 INFO L87 Difference]: Start difference. First operand 3164 states and 4471 transitions. Second operand 5 states. [2019-10-02 12:54:20,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:20,806 INFO L93 Difference]: Finished difference Result 5538 states and 7722 transitions. [2019-10-02 12:54:20,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:54:20,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2019-10-02 12:54:20,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:20,822 INFO L225 Difference]: With dead ends: 5538 [2019-10-02 12:54:20,822 INFO L226 Difference]: Without dead ends: 3236 [2019-10-02 12:54:20,830 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:54:20,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3236 states. [2019-10-02 12:54:21,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3236 to 3229. [2019-10-02 12:54:21,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3229 states. [2019-10-02 12:54:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 4577 transitions. [2019-10-02 12:54:21,049 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 4577 transitions. Word has length 169 [2019-10-02 12:54:21,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:21,050 INFO L475 AbstractCegarLoop]: Abstraction has 3229 states and 4577 transitions. [2019-10-02 12:54:21,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:54:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 4577 transitions. [2019-10-02 12:54:21,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:54:21,056 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:21,056 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:54:21,056 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:21,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:21,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1483574261, now seen corresponding path program 1 times [2019-10-02 12:54:21,057 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:21,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:21,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:21,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:21,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:21,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:21,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:21,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:21,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:21,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:21,164 INFO L87 Difference]: Start difference. First operand 3229 states and 4577 transitions. Second operand 3 states. [2019-10-02 12:54:21,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:21,337 INFO L93 Difference]: Finished difference Result 6614 states and 9503 transitions. [2019-10-02 12:54:21,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:21,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-10-02 12:54:21,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:21,350 INFO L225 Difference]: With dead ends: 6614 [2019-10-02 12:54:21,350 INFO L226 Difference]: Without dead ends: 3489 [2019-10-02 12:54:21,363 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 12:54:21,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3489 states. [2019-10-02 12:54:21,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3489 to 3486. [2019-10-02 12:54:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2019-10-02 12:54:21,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 5037 transitions. [2019-10-02 12:54:21,601 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 5037 transitions. Word has length 175 [2019-10-02 12:54:21,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:21,601 INFO L475 AbstractCegarLoop]: Abstraction has 3486 states and 5037 transitions. [2019-10-02 12:54:21,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:21,602 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 5037 transitions. [2019-10-02 12:54:21,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 12:54:21,610 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:21,611 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-02 12:54:21,611 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:21,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:21,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2040481891, now seen corresponding path program 2 times [2019-10-02 12:54:21,612 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:21,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:21,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:21,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:21,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:21,744 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:21,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:21,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:54:21,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:54:21,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:54:21,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:54:21,746 INFO L87 Difference]: Start difference. First operand 3486 states and 5037 transitions. Second operand 6 states. [2019-10-02 12:54:21,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:21,918 INFO L93 Difference]: Finished difference Result 6819 states and 9870 transitions. [2019-10-02 12:54:21,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:54:21,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-10-02 12:54:21,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:21,931 INFO L225 Difference]: With dead ends: 6819 [2019-10-02 12:54:21,931 INFO L226 Difference]: Without dead ends: 3489 [2019-10-02 12:54:21,941 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:54:21,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3489 states. [2019-10-02 12:54:22,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3489 to 3486. [2019-10-02 12:54:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2019-10-02 12:54:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 5031 transitions. [2019-10-02 12:54:22,257 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 5031 transitions. Word has length 176 [2019-10-02 12:54:22,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:22,258 INFO L475 AbstractCegarLoop]: Abstraction has 3486 states and 5031 transitions. [2019-10-02 12:54:22,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:54:22,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 5031 transitions. [2019-10-02 12:54:22,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 12:54:22,266 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:22,266 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:54:22,266 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:22,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:22,267 INFO L82 PathProgramCache]: Analyzing trace with hash -365194644, now seen corresponding path program 1 times [2019-10-02 12:54:22,267 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:22,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:22,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:22,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:54:22,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:22,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:22,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:22,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:22,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:22,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:22,386 INFO L87 Difference]: Start difference. First operand 3486 states and 5031 transitions. Second operand 3 states. [2019-10-02 12:54:22,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:22,543 INFO L93 Difference]: Finished difference Result 7347 states and 10808 transitions. [2019-10-02 12:54:22,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:22,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-10-02 12:54:22,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:22,557 INFO L225 Difference]: With dead ends: 7347 [2019-10-02 12:54:22,557 INFO L226 Difference]: Without dead ends: 3971 [2019-10-02 12:54:22,566 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 12:54:22,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3971 states. [2019-10-02 12:54:22,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3971 to 3968. [2019-10-02 12:54:22,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3968 states. [2019-10-02 12:54:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 5890 transitions. [2019-10-02 12:54:22,817 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 5890 transitions. Word has length 176 [2019-10-02 12:54:22,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:22,817 INFO L475 AbstractCegarLoop]: Abstraction has 3968 states and 5890 transitions. [2019-10-02 12:54:22,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 5890 transitions. [2019-10-02 12:54:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 12:54:22,827 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:22,828 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:22,829 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:22,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:22,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1157622029, now seen corresponding path program 1 times [2019-10-02 12:54:22,829 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:22,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:22,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:22,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:22,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:22,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:22,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:22,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:22,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:22,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:22,941 INFO L87 Difference]: Start difference. First operand 3968 states and 5890 transitions. Second operand 3 states. [2019-10-02 12:54:23,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:23,163 INFO L93 Difference]: Finished difference Result 8751 states and 13292 transitions. [2019-10-02 12:54:23,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:23,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-10-02 12:54:23,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:23,180 INFO L225 Difference]: With dead ends: 8751 [2019-10-02 12:54:23,180 INFO L226 Difference]: Without dead ends: 4901 [2019-10-02 12:54:23,190 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 12:54:23,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4901 states. [2019-10-02 12:54:23,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4901 to 4898. [2019-10-02 12:54:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4898 states. [2019-10-02 12:54:23,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4898 states to 4898 states and 7515 transitions. [2019-10-02 12:54:23,463 INFO L78 Accepts]: Start accepts. Automaton has 4898 states and 7515 transitions. Word has length 177 [2019-10-02 12:54:23,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:23,464 INFO L475 AbstractCegarLoop]: Abstraction has 4898 states and 7515 transitions. [2019-10-02 12:54:23,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 4898 states and 7515 transitions. [2019-10-02 12:54:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:54:23,479 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:23,480 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:54:23,480 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:23,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:23,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1930087660, now seen corresponding path program 1 times [2019-10-02 12:54:23,481 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:23,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:23,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:23,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:23,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:23,591 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:23,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:23,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:23,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:23,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:23,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:23,593 INFO L87 Difference]: Start difference. First operand 4898 states and 7515 transitions. Second operand 3 states. [2019-10-02 12:54:23,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:23,919 INFO L93 Difference]: Finished difference Result 11451 states and 18002 transitions. [2019-10-02 12:54:23,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:23,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-10-02 12:54:23,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:23,943 INFO L225 Difference]: With dead ends: 11451 [2019-10-02 12:54:23,943 INFO L226 Difference]: Without dead ends: 6683 [2019-10-02 12:54:23,954 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 12:54:23,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6683 states. [2019-10-02 12:54:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6683 to 6680. [2019-10-02 12:54:24,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6680 states. [2019-10-02 12:54:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6680 states to 6680 states and 10592 transitions. [2019-10-02 12:54:24,327 INFO L78 Accepts]: Start accepts. Automaton has 6680 states and 10592 transitions. Word has length 178 [2019-10-02 12:54:24,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:24,328 INFO L475 AbstractCegarLoop]: Abstraction has 6680 states and 10592 transitions. [2019-10-02 12:54:24,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:24,328 INFO L276 IsEmpty]: Start isEmpty. Operand 6680 states and 10592 transitions. [2019-10-02 12:54:24,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 12:54:24,352 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:24,352 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:54:24,353 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:24,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:24,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1656861325, now seen corresponding path program 1 times [2019-10-02 12:54:24,353 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:24,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:24,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:24,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:24,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:24,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:24,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:24,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:24,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:24,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:24,472 INFO L87 Difference]: Start difference. First operand 6680 states and 10592 transitions. Second operand 3 states. [2019-10-02 12:54:24,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:24,821 INFO L93 Difference]: Finished difference Result 16633 states and 27020 transitions. [2019-10-02 12:54:24,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:24,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-10-02 12:54:24,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:24,850 INFO L225 Difference]: With dead ends: 16633 [2019-10-02 12:54:24,850 INFO L226 Difference]: Without dead ends: 10093 [2019-10-02 12:54:24,866 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 12:54:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2019-10-02 12:54:25,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 10090. [2019-10-02 12:54:25,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10090 states. [2019-10-02 12:54:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10090 states to 10090 states and 16497 transitions. [2019-10-02 12:54:25,444 INFO L78 Accepts]: Start accepts. Automaton has 10090 states and 16497 transitions. Word has length 179 [2019-10-02 12:54:25,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:25,445 INFO L475 AbstractCegarLoop]: Abstraction has 10090 states and 16497 transitions. [2019-10-02 12:54:25,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:25,445 INFO L276 IsEmpty]: Start isEmpty. Operand 10090 states and 16497 transitions. [2019-10-02 12:54:25,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 12:54:25,465 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:25,465 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:54:25,466 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:25,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:25,466 INFO L82 PathProgramCache]: Analyzing trace with hash 718405484, now seen corresponding path program 1 times [2019-10-02 12:54:25,466 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:25,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:25,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:25,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:25,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:25,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:25,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:25,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:25,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:25,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:25,570 INFO L87 Difference]: Start difference. First operand 10090 states and 16497 transitions. Second operand 3 states. [2019-10-02 12:54:26,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:26,111 INFO L93 Difference]: Finished difference Result 26567 states and 44246 transitions. [2019-10-02 12:54:26,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:26,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-02 12:54:26,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:26,155 INFO L225 Difference]: With dead ends: 26567 [2019-10-02 12:54:26,156 INFO L226 Difference]: Without dead ends: 16623 [2019-10-02 12:54:26,181 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 12:54:26,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16623 states. [2019-10-02 12:54:27,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16623 to 16620. [2019-10-02 12:54:27,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16620 states. [2019-10-02 12:54:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16620 states to 16620 states and 27730 transitions. [2019-10-02 12:54:27,732 INFO L78 Accepts]: Start accepts. Automaton has 16620 states and 27730 transitions. Word has length 180 [2019-10-02 12:54:27,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:27,732 INFO L475 AbstractCegarLoop]: Abstraction has 16620 states and 27730 transitions. [2019-10-02 12:54:27,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:27,732 INFO L276 IsEmpty]: Start isEmpty. Operand 16620 states and 27730 transitions. [2019-10-02 12:54:27,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 12:54:27,760 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:27,760 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2019-10-02 12:54:27,760 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:27,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:27,760 INFO L82 PathProgramCache]: Analyzing trace with hash -614427163, now seen corresponding path program 1 times [2019-10-02 12:54:27,760 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:27,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:27,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:27,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:27,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:54:27,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:54:27,880 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 12:54:28,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:28,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 2710 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:54:28,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:54:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-10-02 12:54:28,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:54:28,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 12:54:28,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:54:28,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:54:28,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:54:28,447 INFO L87 Difference]: Start difference. First operand 16620 states and 27730 transitions. Second operand 6 states. [2019-10-02 12:54:29,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:29,158 INFO L93 Difference]: Finished difference Result 19842 states and 32335 transitions. [2019-10-02 12:54:29,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:54:29,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 187 [2019-10-02 12:54:29,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:29,212 INFO L225 Difference]: With dead ends: 19842 [2019-10-02 12:54:29,213 INFO L226 Difference]: Without dead ends: 17540 [2019-10-02 12:54:29,223 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:54:29,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17540 states. [2019-10-02 12:54:29,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17540 to 17461. [2019-10-02 12:54:29,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17461 states. [2019-10-02 12:54:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17461 states to 17461 states and 29049 transitions. [2019-10-02 12:54:29,978 INFO L78 Accepts]: Start accepts. Automaton has 17461 states and 29049 transitions. Word has length 187 [2019-10-02 12:54:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:29,978 INFO L475 AbstractCegarLoop]: Abstraction has 17461 states and 29049 transitions. [2019-10-02 12:54:29,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:54:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 17461 states and 29049 transitions. [2019-10-02 12:54:30,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 12:54:30,027 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:30,028 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:54:30,028 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:30,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:30,028 INFO L82 PathProgramCache]: Analyzing trace with hash -144210931, now seen corresponding path program 1 times [2019-10-02 12:54:30,028 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:30,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:30,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:30,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:30,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:30,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:30,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:30,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:30,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:30,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:30,138 INFO L87 Difference]: Start difference. First operand 17461 states and 29049 transitions. Second operand 3 states. [2019-10-02 12:54:31,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:31,341 INFO L93 Difference]: Finished difference Result 46845 states and 79000 transitions. [2019-10-02 12:54:31,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:31,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-10-02 12:54:31,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:31,446 INFO L225 Difference]: With dead ends: 46845 [2019-10-02 12:54:31,446 INFO L226 Difference]: Without dead ends: 30028 [2019-10-02 12:54:31,490 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 12:54:31,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30028 states. [2019-10-02 12:54:33,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30028 to 30025. [2019-10-02 12:54:33,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30025 states. [2019-10-02 12:54:33,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30025 states to 30025 states and 50461 transitions. [2019-10-02 12:54:33,865 INFO L78 Accepts]: Start accepts. Automaton has 30025 states and 50461 transitions. Word has length 181 [2019-10-02 12:54:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:33,866 INFO L475 AbstractCegarLoop]: Abstraction has 30025 states and 50461 transitions. [2019-10-02 12:54:33,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 30025 states and 50461 transitions. [2019-10-02 12:54:33,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 12:54:33,914 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:33,914 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:54:33,914 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:33,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:33,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1313265172, now seen corresponding path program 1 times [2019-10-02 12:54:33,915 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:33,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:33,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:33,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:33,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:34,014 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:34,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:34,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:34,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:34,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:34,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:34,015 INFO L87 Difference]: Start difference. First operand 30025 states and 50461 transitions. Second operand 3 states. [2019-10-02 12:54:36,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:36,341 INFO L93 Difference]: Finished difference Result 83263 states and 140383 transitions. [2019-10-02 12:54:36,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:36,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-10-02 12:54:36,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:36,481 INFO L225 Difference]: With dead ends: 83263 [2019-10-02 12:54:36,481 INFO L226 Difference]: Without dead ends: 54016 [2019-10-02 12:54:36,531 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:36,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54016 states. [2019-10-02 12:54:40,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54016 to 54013. [2019-10-02 12:54:40,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54013 states. [2019-10-02 12:54:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54013 states to 54013 states and 90253 transitions. [2019-10-02 12:54:40,812 INFO L78 Accepts]: Start accepts. Automaton has 54013 states and 90253 transitions. Word has length 182 [2019-10-02 12:54:40,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:40,812 INFO L475 AbstractCegarLoop]: Abstraction has 54013 states and 90253 transitions. [2019-10-02 12:54:40,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:40,813 INFO L276 IsEmpty]: Start isEmpty. Operand 54013 states and 90253 transitions. [2019-10-02 12:54:40,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 12:54:40,868 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:40,868 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:54:40,868 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:40,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:40,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2064211341, now seen corresponding path program 1 times [2019-10-02 12:54:40,869 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:40,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:40,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:40,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:40,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:40,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:40,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:40,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:40,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:40,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:40,969 INFO L87 Difference]: Start difference. First operand 54013 states and 90253 transitions. Second operand 3 states. [2019-10-02 12:54:45,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:45,156 INFO L93 Difference]: Finished difference Result 152433 states and 255994 transitions. [2019-10-02 12:54:45,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:45,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-10-02 12:54:45,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:45,496 INFO L225 Difference]: With dead ends: 152433 [2019-10-02 12:54:45,497 INFO L226 Difference]: Without dead ends: 99420 [2019-10-02 12:54:45,618 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 12:54:45,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99420 states. [2019-10-02 12:54:51,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99420 to 99417. [2019-10-02 12:54:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99417 states. [2019-10-02 12:54:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99417 states to 99417 states and 165619 transitions. [2019-10-02 12:54:55,580 INFO L78 Accepts]: Start accepts. Automaton has 99417 states and 165619 transitions. Word has length 183 [2019-10-02 12:54:55,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:55,581 INFO L475 AbstractCegarLoop]: Abstraction has 99417 states and 165619 transitions. [2019-10-02 12:54:55,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:55,581 INFO L276 IsEmpty]: Start isEmpty. Operand 99417 states and 165619 transitions. [2019-10-02 12:54:55,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 12:54:55,646 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:55,646 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:54:55,646 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:55,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:55,647 INFO L82 PathProgramCache]: Analyzing trace with hash 392711276, now seen corresponding path program 1 times [2019-10-02 12:54:55,647 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:55,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:55,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:55,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:55,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:55,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:55,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:55,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:55,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:55,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:55,748 INFO L87 Difference]: Start difference. First operand 99417 states and 165619 transitions. Second operand 3 states. [2019-10-02 12:55:04,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:04,953 INFO L93 Difference]: Finished difference Result 187900 states and 310297 transitions. [2019-10-02 12:55:04,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:55:04,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-10-02 12:55:04,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:05,508 INFO L225 Difference]: With dead ends: 187900 [2019-10-02 12:55:05,508 INFO L226 Difference]: Without dead ends: 185598 [2019-10-02 12:55:05,576 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 12:55:05,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185598 states. [2019-10-02 12:55:15,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185598 to 185595. [2019-10-02 12:55:15,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185595 states. [2019-10-02 12:55:21,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185595 states to 185595 states and 304068 transitions. [2019-10-02 12:55:21,304 INFO L78 Accepts]: Start accepts. Automaton has 185595 states and 304068 transitions. Word has length 184 [2019-10-02 12:55:21,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:21,304 INFO L475 AbstractCegarLoop]: Abstraction has 185595 states and 304068 transitions. [2019-10-02 12:55:21,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:55:21,305 INFO L276 IsEmpty]: Start isEmpty. Operand 185595 states and 304068 transitions. [2019-10-02 12:55:21,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 12:55:21,394 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:21,394 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:55:21,395 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:21,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:21,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1237369075, now seen corresponding path program 1 times [2019-10-02 12:55:21,395 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:21,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:21,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:21,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:21,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:55:21,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:21,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:55:21,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:55:21,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:55:21,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:55:21,528 INFO L87 Difference]: Start difference. First operand 185595 states and 304068 transitions. Second operand 3 states. [2019-10-02 12:55:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:32,289 INFO L93 Difference]: Finished difference Result 188387 states and 307908 transitions. [2019-10-02 12:55:32,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:55:32,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-10-02 12:55:32,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:32,809 INFO L225 Difference]: With dead ends: 188387 [2019-10-02 12:55:32,809 INFO L226 Difference]: Without dead ends: 186140 [2019-10-02 12:55:32,864 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 12:55:32,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186140 states. [2019-10-02 12:55:44,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186140 to 186140. [2019-10-02 12:55:44,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186140 states. [2019-10-02 12:55:45,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186140 states to 186140 states and 304800 transitions. [2019-10-02 12:55:45,309 INFO L78 Accepts]: Start accepts. Automaton has 186140 states and 304800 transitions. Word has length 185 [2019-10-02 12:55:45,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:45,309 INFO L475 AbstractCegarLoop]: Abstraction has 186140 states and 304800 transitions. [2019-10-02 12:55:45,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:55:45,310 INFO L276 IsEmpty]: Start isEmpty. Operand 186140 states and 304800 transitions. [2019-10-02 12:55:46,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-02 12:55:46,052 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:46,052 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:46,052 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:46,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:46,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1385786655, now seen corresponding path program 1 times [2019-10-02 12:55:46,053 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:46,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:46,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:46,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:46,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 12:55:46,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:46,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:55:46,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:55:46,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:55:46,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:55:46,238 INFO L87 Difference]: Start difference. First operand 186140 states and 304800 transitions. Second operand 6 states. [2019-10-02 12:56:08,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:08,741 INFO L93 Difference]: Finished difference Result 365882 states and 602075 transitions. [2019-10-02 12:56:08,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:56:08,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 306 [2019-10-02 12:56:08,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:10,116 INFO L225 Difference]: With dead ends: 365882 [2019-10-02 12:56:10,117 INFO L226 Difference]: Without dead ends: 363139 [2019-10-02 12:56:10,229 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:56:10,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363139 states. [2019-10-02 12:56:43,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363139 to 363076. [2019-10-02 12:56:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363076 states. [2019-10-02 12:56:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363076 states to 363076 states and 598272 transitions. [2019-10-02 12:56:45,042 INFO L78 Accepts]: Start accepts. Automaton has 363076 states and 598272 transitions. Word has length 306 [2019-10-02 12:56:45,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:45,043 INFO L475 AbstractCegarLoop]: Abstraction has 363076 states and 598272 transitions. [2019-10-02 12:56:45,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:56:45,043 INFO L276 IsEmpty]: Start isEmpty. Operand 363076 states and 598272 transitions. [2019-10-02 12:56:46,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-10-02 12:56:46,524 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:46,524 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:56:46,524 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:46,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:46,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1935798206, now seen corresponding path program 1 times [2019-10-02 12:56:46,525 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:46,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:46,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:46,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:46,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:46,715 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 12:56:46,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:46,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:56:46,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:56:46,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:56:46,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:56:46,717 INFO L87 Difference]: Start difference. First operand 363076 states and 598272 transitions. Second operand 9 states. [2019-10-02 12:57:09,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:57:09,458 INFO L93 Difference]: Finished difference Result 368429 states and 605429 transitions. [2019-10-02 12:57:09,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:57:09,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 307 [2019-10-02 12:57:09,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:57:10,807 INFO L225 Difference]: With dead ends: 368429 [2019-10-02 12:57:10,807 INFO L226 Difference]: Without dead ends: 362824 [2019-10-02 12:57:10,935 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:57:11,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362824 states. [2019-10-02 12:57:52,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362824 to 362768. [2019-10-02 12:57:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362768 states. [2019-10-02 12:57:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362768 states to 362768 states and 597732 transitions. [2019-10-02 12:57:54,686 INFO L78 Accepts]: Start accepts. Automaton has 362768 states and 597732 transitions. Word has length 307 [2019-10-02 12:57:54,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:57:54,687 INFO L475 AbstractCegarLoop]: Abstraction has 362768 states and 597732 transitions. [2019-10-02 12:57:54,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:57:54,687 INFO L276 IsEmpty]: Start isEmpty. Operand 362768 states and 597732 transitions. [2019-10-02 12:57:56,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-10-02 12:57:56,407 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:57:56,407 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:57:56,407 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:57:56,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:57:56,408 INFO L82 PathProgramCache]: Analyzing trace with hash -2107964377, now seen corresponding path program 1 times [2019-10-02 12:57:56,408 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:57:56,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:57:56,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:56,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:57:56,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:57:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 12:57:56,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:57:56,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:57:56,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:57:56,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:57:56,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:57:56,585 INFO L87 Difference]: Start difference. First operand 362768 states and 597732 transitions. Second operand 5 states. [2019-10-02 12:58:20,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:20,022 INFO L93 Difference]: Finished difference Result 365844 states and 601777 transitions. [2019-10-02 12:58:20,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:58:20,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 299 [2019-10-02 12:58:20,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:21,051 INFO L225 Difference]: With dead ends: 365844 [2019-10-02 12:58:21,051 INFO L226 Difference]: Without dead ends: 362528 [2019-10-02 12:58:21,161 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:58:21,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362528 states. [2019-10-02 12:59:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362528 to 361946. [2019-10-02 12:59:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361946 states. [2019-10-02 12:59:02,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361946 states to 361946 states and 596625 transitions. [2019-10-02 12:59:02,534 INFO L78 Accepts]: Start accepts. Automaton has 361946 states and 596625 transitions. Word has length 299 [2019-10-02 12:59:02,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:02,534 INFO L475 AbstractCegarLoop]: Abstraction has 361946 states and 596625 transitions. [2019-10-02 12:59:02,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:59:02,534 INFO L276 IsEmpty]: Start isEmpty. Operand 361946 states and 596625 transitions. [2019-10-02 12:59:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-02 12:59:04,122 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:04,123 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:04,123 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:04,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:04,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1547521765, now seen corresponding path program 1 times [2019-10-02 12:59:04,123 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:04,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:04,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:04,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:04,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:05,062 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 12:59:05,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:05,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:59:05,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:59:05,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:59:05,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:59:05,064 INFO L87 Difference]: Start difference. First operand 361946 states and 596625 transitions. Second operand 11 states. [2019-10-02 12:59:34,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:34,894 INFO L93 Difference]: Finished difference Result 368141 states and 604896 transitions. [2019-10-02 12:59:34,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:59:34,894 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 300 [2019-10-02 12:59:34,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:36,220 INFO L225 Difference]: With dead ends: 368141 [2019-10-02 12:59:36,221 INFO L226 Difference]: Without dead ends: 364447 [2019-10-02 12:59:36,328 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:59:36,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364447 states. [2019-10-02 13:00:14,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364447 to 364338. [2019-10-02 13:00:14,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364338 states. [2019-10-02 13:00:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364338 states to 364338 states and 599786 transitions. [2019-10-02 13:00:15,135 INFO L78 Accepts]: Start accepts. Automaton has 364338 states and 599786 transitions. Word has length 300 [2019-10-02 13:00:15,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:15,136 INFO L475 AbstractCegarLoop]: Abstraction has 364338 states and 599786 transitions. [2019-10-02 13:00:15,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:00:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 364338 states and 599786 transitions. [2019-10-02 13:00:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-10-02 13:00:17,969 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:17,970 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:00:17,970 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:17,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:17,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1814803901, now seen corresponding path program 1 times [2019-10-02 13:00:17,971 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:17,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:17,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:17,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:17,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:18,127 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-02 13:00:18,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:18,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:00:18,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:00:18,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:00:18,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:00:18,129 INFO L87 Difference]: Start difference. First operand 364338 states and 599786 transitions. Second operand 7 states. [2019-10-02 13:00:46,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:46,067 INFO L93 Difference]: Finished difference Result 719479 states and 1194436 transitions. [2019-10-02 13:00:46,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:00:46,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 352 [2019-10-02 13:00:46,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:47,254 INFO L225 Difference]: With dead ends: 719479 [2019-10-02 13:00:47,255 INFO L226 Difference]: Without dead ends: 364392 [2019-10-02 13:00:47,878 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:00:48,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364392 states. [2019-10-02 13:01:22,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364392 to 364392. [2019-10-02 13:01:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364392 states. [2019-10-02 13:01:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364392 states to 364392 states and 599852 transitions. [2019-10-02 13:01:24,353 INFO L78 Accepts]: Start accepts. Automaton has 364392 states and 599852 transitions. Word has length 352 [2019-10-02 13:01:24,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:01:24,353 INFO L475 AbstractCegarLoop]: Abstraction has 364392 states and 599852 transitions. [2019-10-02 13:01:24,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:01:24,353 INFO L276 IsEmpty]: Start isEmpty. Operand 364392 states and 599852 transitions. [2019-10-02 13:01:26,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-10-02 13:01:26,073 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:01:26,073 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:26,074 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:01:26,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:01:26,074 INFO L82 PathProgramCache]: Analyzing trace with hash -852981930, now seen corresponding path program 1 times [2019-10-02 13:01:26,074 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:01:26,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:01:26,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:01:26,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:01:26,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:01:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:01:26,237 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-02 13:01:26,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:01:26,238 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:01:26,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:01:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:01:34,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 3647 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 13:01:34,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:01:34,752 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-10-02 13:01:34,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:01:34,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-10-02 13:01:34,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:01:34,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:01:34,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:01:34,765 INFO L87 Difference]: Start difference. First operand 364392 states and 599852 transitions. Second operand 11 states. [2019-10-02 13:01:54,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:01:54,456 INFO L93 Difference]: Finished difference Result 381457 states and 625268 transitions. [2019-10-02 13:01:54,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:01:54,457 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 353 [2019-10-02 13:01:54,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:01:55,685 INFO L225 Difference]: With dead ends: 381457 [2019-10-02 13:01:55,686 INFO L226 Difference]: Without dead ends: 374446 [2019-10-02 13:01:55,789 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:01:56,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374446 states. [2019-10-02 13:02:29,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374446 to 374435. [2019-10-02 13:02:29,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374435 states. [2019-10-02 13:02:30,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374435 states to 374435 states and 614950 transitions. [2019-10-02 13:02:30,379 INFO L78 Accepts]: Start accepts. Automaton has 374435 states and 614950 transitions. Word has length 353 [2019-10-02 13:02:30,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:02:30,380 INFO L475 AbstractCegarLoop]: Abstraction has 374435 states and 614950 transitions. [2019-10-02 13:02:30,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:02:30,380 INFO L276 IsEmpty]: Start isEmpty. Operand 374435 states and 614950 transitions. [2019-10-02 13:02:33,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-10-02 13:02:33,614 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:02:33,614 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:33,615 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:02:33,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:02:33,615 INFO L82 PathProgramCache]: Analyzing trace with hash 709921390, now seen corresponding path program 1 times [2019-10-02 13:02:33,615 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:02:33,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:02:33,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:33,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:02:33,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:02:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-10-02 13:02:33,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:02:33,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:02:33,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:02:33,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:02:33,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:02:33,813 INFO L87 Difference]: Start difference. First operand 374435 states and 614950 transitions. Second operand 6 states. [2019-10-02 13:03:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:03:03,096 INFO L93 Difference]: Finished difference Result 738660 states and 1214505 transitions. [2019-10-02 13:03:03,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 13:03:03,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 372 [2019-10-02 13:03:03,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:03:04,237 INFO L225 Difference]: With dead ends: 738660 [2019-10-02 13:03:04,237 INFO L226 Difference]: Without dead ends: 374441 [2019-10-02 13:03:04,763 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:03:05,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374441 states. [2019-10-02 13:03:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374441 to 374435. [2019-10-02 13:03:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374435 states. [2019-10-02 13:03:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374435 states to 374435 states and 608973 transitions. [2019-10-02 13:03:39,397 INFO L78 Accepts]: Start accepts. Automaton has 374435 states and 608973 transitions. Word has length 372 [2019-10-02 13:03:39,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:03:39,397 INFO L475 AbstractCegarLoop]: Abstraction has 374435 states and 608973 transitions. [2019-10-02 13:03:39,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:03:39,398 INFO L276 IsEmpty]: Start isEmpty. Operand 374435 states and 608973 transitions.