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-112bae1 [2019-09-08 04:39:36,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:39:36,397 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:39:36,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:39:36,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:39:36,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:39:36,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:39:36,415 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:39:36,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:39:36,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:39:36,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:39:36,430 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:39:36,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:39:36,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:39:36,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:39:36,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:39:36,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:39:36,437 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:39:36,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:39:36,440 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:39:36,442 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:39:36,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:39:36,444 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:39:36,444 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:39:36,447 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:39:36,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:39:36,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:39:36,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:39:36,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:39:36,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:39:36,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:39:36,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:39:36,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:39:36,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:39:36,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:39:36,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:39:36,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:39:36,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:39:36,454 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:39:36,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:39:36,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:39:36,456 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 04:39:36,471 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:39:36,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:39:36,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:39:36,473 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:39:36,473 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:39:36,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:39:36,473 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:39:36,474 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:39:36,474 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:39:36,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:39:36,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:39:36,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:39:36,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:39:36,475 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:39:36,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:39:36,475 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:39:36,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:39:36,476 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:39:36,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:39:36,476 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:39:36,476 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:39:36,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:39:36,477 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:39:36,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:39:36,477 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:39:36,478 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:39:36,478 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:39:36,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:39:36,478 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:39:36,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:39:36,524 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:39:36,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:39:36,529 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:39:36,530 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:39:36,531 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-09-08 04:39:36,604 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00076f257/35a0959f509a46868d0072bfc47e6ea0/FLAG18760e3de [2019-09-08 04:39:37,195 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:39:37,196 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product21.cil.c [2019-09-08 04:39:37,221 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00076f257/35a0959f509a46868d0072bfc47e6ea0/FLAG18760e3de [2019-09-08 04:39:37,445 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00076f257/35a0959f509a46868d0072bfc47e6ea0 [2019-09-08 04:39:37,456 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:39:37,457 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:39:37,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:39:37,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:39:37,462 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:39:37,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:39:37" (1/1) ... [2019-09-08 04:39:37,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a24c4c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:37, skipping insertion in model container [2019-09-08 04:39:37,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:39:37" (1/1) ... [2019-09-08 04:39:37,474 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:39:37,558 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:39:38,492 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:39:38,509 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:39:38,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:39:38,718 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:39:38,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:38 WrapperNode [2019-09-08 04:39:38,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:39:38,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:39:38,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:39:38,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:39:38,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:38" (1/1) ... [2019-09-08 04:39:38,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:38" (1/1) ... [2019-09-08 04:39:38,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:38" (1/1) ... [2019-09-08 04:39:38,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:38" (1/1) ... [2019-09-08 04:39:38,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:38" (1/1) ... [2019-09-08 04:39:38,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:38" (1/1) ... [2019-09-08 04:39:38,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:38" (1/1) ... [2019-09-08 04:39:38,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:39:38,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:39:38,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:39:38,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:39:38,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:39:39,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:39:39,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:39:39,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:39:39,006 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-09-08 04:39:39,007 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 04:39:39,007 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 04:39:39,007 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 04:39:39,007 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 04:39:39,008 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 04:39:39,008 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 04:39:39,009 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 04:39:39,009 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 04:39:39,009 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 04:39:39,010 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 04:39:39,010 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 04:39:39,011 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 04:39:39,013 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 04:39:39,013 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 04:39:39,013 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 04:39:39,013 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 04:39:39,014 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 04:39:39,014 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 04:39:39,014 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 04:39:39,014 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 04:39:39,014 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 04:39:39,014 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:39:39,014 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 04:39:39,015 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 04:39:39,015 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 04:39:39,015 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 04:39:39,015 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 04:39:39,015 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 04:39:39,015 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 04:39:39,016 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:39:39,016 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:39:39,016 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:39:39,016 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:39:39,016 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:39:39,016 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:39:39,016 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:39:39,017 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:39:39,017 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:39:39,017 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:39:39,017 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 04:39:39,017 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 04:39:39,017 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-09-08 04:39:39,017 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 04:39:39,018 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 04:39:39,018 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-09-08 04:39:39,018 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-08 04:39:39,018 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 04:39:39,018 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 04:39:39,018 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 04:39:39,018 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 04:39:39,019 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 04:39:39,019 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 04:39:39,019 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 04:39:39,019 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 04:39:39,019 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 04:39:39,020 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 04:39:39,020 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 04:39:39,020 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 04:39:39,020 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 04:39:39,020 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 04:39:39,021 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 04:39:39,021 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 04:39:39,021 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 04:39:39,021 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 04:39:39,022 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 04:39:39,022 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 04:39:39,022 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 04:39:39,022 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 04:39:39,022 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 04:39:39,022 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 04:39:39,023 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 04:39:39,023 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 04:39:39,024 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 04:39:39,024 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 04:39:39,024 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 04:39:39,024 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 04:39:39,024 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 04:39:39,024 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 04:39:39,025 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 04:39:39,025 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 04:39:39,025 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 04:39:39,025 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 04:39:39,026 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 04:39:39,026 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 04:39:39,027 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 04:39:39,027 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 04:39:39,028 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 04:39:39,028 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 04:39:39,028 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 04:39:39,028 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 04:39:39,028 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 04:39:39,028 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 04:39:39,028 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 04:39:39,029 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 04:39:39,029 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:39:39,029 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:39:39,029 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 04:39:39,029 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 04:39:39,029 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 04:39:39,029 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 04:39:39,030 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 04:39:39,030 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 04:39:39,030 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 04:39:39,030 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 04:39:39,030 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 04:39:39,030 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 04:39:39,030 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 04:39:39,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:39:39,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:39:39,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:39:39,031 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:39:39,032 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 04:39:39,032 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 04:39:39,032 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-09-08 04:39:39,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:39:39,032 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 04:39:39,033 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 04:39:39,033 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 04:39:39,033 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 04:39:39,033 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 04:39:39,035 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 04:39:39,035 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 04:39:39,035 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 04:39:39,035 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 04:39:39,035 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 04:39:39,035 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 04:39:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 04:39:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 04:39:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 04:39:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 04:39:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 04:39:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 04:39:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 04:39:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 04:39:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 04:39:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 04:39:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 04:39:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 04:39:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 04:39:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 04:39:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 04:39:39,051 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 04:39:39,051 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 04:39:39,051 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 04:39:39,051 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 04:39:39,051 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:39:39,051 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:39:39,051 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 04:39:39,052 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 04:39:39,052 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 04:39:39,052 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 04:39:39,052 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 04:39:39,052 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 04:39:39,052 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 04:39:39,052 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:39:39,053 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:39:39,053 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:39:39,053 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:39:39,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:39:39,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:39:39,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:39:39,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:39:39,053 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:39:39,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:39:39,054 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:39:39,054 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:39:39,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:39:39,054 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:39:39,054 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:39:39,054 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:39:39,055 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:39:39,055 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:39:39,055 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:39:39,055 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:39:39,055 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 04:39:39,055 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 04:39:39,055 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 04:39:39,055 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 04:39:39,056 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 04:39:39,056 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 04:39:39,056 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 04:39:39,056 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 04:39:39,056 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 04:39:39,056 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 04:39:39,056 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 04:39:39,057 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 04:39:39,057 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 04:39:39,057 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 04:39:39,057 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 04:39:39,057 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 04:39:39,057 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 04:39:39,058 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 04:39:39,058 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 04:39:39,058 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 04:39:39,058 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 04:39:39,058 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 04:39:39,058 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 04:39:39,059 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-09-08 04:39:39,059 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-09-08 04:39:39,059 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-08 04:39:39,059 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 04:39:39,059 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 04:39:39,059 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 04:39:39,060 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 04:39:39,060 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 04:39:39,060 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 04:39:39,060 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 04:39:39,060 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 04:39:39,060 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 04:39:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 04:39:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 04:39:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 04:39:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 04:39:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 04:39:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 04:39:39,062 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 04:39:39,062 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 04:39:39,062 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 04:39:39,062 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 04:39:39,062 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 04:39:39,062 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 04:39:39,062 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 04:39:39,063 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 04:39:39,063 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 04:39:39,063 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 04:39:39,063 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:39:39,063 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:39:39,063 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 04:39:39,064 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 04:39:39,064 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 04:39:39,064 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 04:39:39,064 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 04:39:39,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:39:39,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:39:39,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:39:40,992 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:39:40,993 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 04:39:40,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:39:40 BoogieIcfgContainer [2019-09-08 04:39:40,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:39:40,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:39:40,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:39:40,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:39:40,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:39:37" (1/3) ... [2019-09-08 04:39:41,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348b24e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:39:40, skipping insertion in model container [2019-09-08 04:39:41,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:38" (2/3) ... [2019-09-08 04:39:41,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348b24e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:39:41, skipping insertion in model container [2019-09-08 04:39:41,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:39:40" (3/3) ... [2019-09-08 04:39:41,002 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec1_product21.cil.c [2019-09-08 04:39:41,012 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:39:41,023 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:39:41,040 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:39:41,085 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:39:41,086 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:39:41,086 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:39:41,086 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:39:41,086 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:39:41,086 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:39:41,087 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:39:41,087 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:39:41,087 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:39:41,125 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states. [2019-09-08 04:39:41,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 04:39:41,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:41,154 INFO L399 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-09-08 04:39:41,157 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:41,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:41,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1310424730, now seen corresponding path program 1 times [2019-09-08 04:39:41,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:41,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:41,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:41,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:41,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:41,804 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:39:41,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:41,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 04:39:41,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 04:39:41,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 04:39:41,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:39:41,831 INFO L87 Difference]: Start difference. First operand 569 states. Second operand 2 states. [2019-09-08 04:39:41,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:41,959 INFO L93 Difference]: Finished difference Result 824 states and 1118 transitions. [2019-09-08 04:39:41,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 04:39:41,960 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 154 [2019-09-08 04:39:41,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:41,986 INFO L225 Difference]: With dead ends: 824 [2019-09-08 04:39:41,986 INFO L226 Difference]: Without dead ends: 540 [2019-09-08 04:39:41,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:39:42,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-09-08 04:39:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-09-08 04:39:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-09-08 04:39:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 738 transitions. [2019-09-08 04:39:42,131 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 738 transitions. Word has length 154 [2019-09-08 04:39:42,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:42,135 INFO L475 AbstractCegarLoop]: Abstraction has 540 states and 738 transitions. [2019-09-08 04:39:42,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 04:39:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 738 transitions. [2019-09-08 04:39:42,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 04:39:42,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:42,145 INFO L399 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-09-08 04:39:42,145 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:42,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:42,147 INFO L82 PathProgramCache]: Analyzing trace with hash 684326183, now seen corresponding path program 1 times [2019-09-08 04:39:42,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:42,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:42,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:42,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:42,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:39:42,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:42,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:42,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:42,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:42,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:42,427 INFO L87 Difference]: Start difference. First operand 540 states and 738 transitions. Second operand 3 states. [2019-09-08 04:39:42,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:42,499 INFO L93 Difference]: Finished difference Result 807 states and 1084 transitions. [2019-09-08 04:39:42,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:42,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-08 04:39:42,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:42,506 INFO L225 Difference]: With dead ends: 807 [2019-09-08 04:39:42,506 INFO L226 Difference]: Without dead ends: 543 [2019-09-08 04:39:42,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:42,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-08 04:39:42,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 542. [2019-09-08 04:39:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-09-08 04:39:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 740 transitions. [2019-09-08 04:39:42,559 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 740 transitions. Word has length 155 [2019-09-08 04:39:42,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:42,561 INFO L475 AbstractCegarLoop]: Abstraction has 542 states and 740 transitions. [2019-09-08 04:39:42,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:42,561 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 740 transitions. [2019-09-08 04:39:42,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 04:39:42,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:42,566 INFO L399 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-09-08 04:39:42,566 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:42,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:42,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1057468101, now seen corresponding path program 1 times [2019-09-08 04:39:42,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:42,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:42,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:42,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:42,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:39:42,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:42,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:42,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:42,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:42,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:42,791 INFO L87 Difference]: Start difference. First operand 542 states and 740 transitions. Second operand 3 states. [2019-09-08 04:39:42,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:42,838 INFO L93 Difference]: Finished difference Result 1062 states and 1481 transitions. [2019-09-08 04:39:42,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:42,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-08 04:39:42,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:42,847 INFO L225 Difference]: With dead ends: 1062 [2019-09-08 04:39:42,847 INFO L226 Difference]: Without dead ends: 585 [2019-09-08 04:39:42,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-09-08 04:39:42,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 584. [2019-09-08 04:39:42,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-08 04:39:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 812 transitions. [2019-09-08 04:39:42,937 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 812 transitions. Word has length 161 [2019-09-08 04:39:42,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:42,939 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 812 transitions. [2019-09-08 04:39:42,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 812 transitions. [2019-09-08 04:39:42,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 04:39:42,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:42,947 INFO L399 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-09-08 04:39:42,947 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:42,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:42,947 INFO L82 PathProgramCache]: Analyzing trace with hash 521417968, now seen corresponding path program 1 times [2019-09-08 04:39:42,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:42,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:42,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:42,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:42,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:39:43,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:39:43,155 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:39:43,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:39:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:43,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 2640 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:39:43,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:39:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 04:39:43,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:39:43,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2019-09-08 04:39:43,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:39:43,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:39:43,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:39:43,942 INFO L87 Difference]: Start difference. First operand 584 states and 812 transitions. Second operand 13 states. [2019-09-08 04:39:45,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:45,638 INFO L93 Difference]: Finished difference Result 1150 states and 1614 transitions. [2019-09-08 04:39:45,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:39:45,641 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 162 [2019-09-08 04:39:45,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:45,646 INFO L225 Difference]: With dead ends: 1150 [2019-09-08 04:39:45,646 INFO L226 Difference]: Without dead ends: 602 [2019-09-08 04:39:45,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:39:45,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-08 04:39:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-09-08 04:39:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-09-08 04:39:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 833 transitions. [2019-09-08 04:39:45,729 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 833 transitions. Word has length 162 [2019-09-08 04:39:45,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:45,730 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 833 transitions. [2019-09-08 04:39:45,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:39:45,730 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 833 transitions. [2019-09-08 04:39:45,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 04:39:45,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:45,734 INFO L399 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-09-08 04:39:45,734 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:45,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:45,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1286349098, now seen corresponding path program 1 times [2019-09-08 04:39:45,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:45,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:45,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:45,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:45,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:45,894 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:39:45,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:45,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:39:45,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:39:45,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:39:45,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:39:45,895 INFO L87 Difference]: Start difference. First operand 600 states and 833 transitions. Second operand 7 states. [2019-09-08 04:39:46,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:46,138 INFO L93 Difference]: Finished difference Result 1148 states and 1603 transitions. [2019-09-08 04:39:46,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:39:46,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2019-09-08 04:39:46,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:46,146 INFO L225 Difference]: With dead ends: 1148 [2019-09-08 04:39:46,146 INFO L226 Difference]: Without dead ends: 614 [2019-09-08 04:39:46,148 INFO L628 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-09-08 04:39:46,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-08 04:39:46,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 610. [2019-09-08 04:39:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-09-08 04:39:46,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 844 transitions. [2019-09-08 04:39:46,188 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 844 transitions. Word has length 164 [2019-09-08 04:39:46,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:46,189 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 844 transitions. [2019-09-08 04:39:46,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:39:46,189 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 844 transitions. [2019-09-08 04:39:46,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 04:39:46,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:46,194 INFO L399 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-09-08 04:39:46,194 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:46,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:46,195 INFO L82 PathProgramCache]: Analyzing trace with hash -515193202, now seen corresponding path program 2 times [2019-09-08 04:39:46,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:46,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:46,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:46,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:46,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:39:46,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:46,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:39:46,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:39:46,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:39:46,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:39:46,393 INFO L87 Difference]: Start difference. First operand 610 states and 844 transitions. Second operand 7 states. [2019-09-08 04:39:46,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:46,638 INFO L93 Difference]: Finished difference Result 1146 states and 1602 transitions. [2019-09-08 04:39:46,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:39:46,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 165 [2019-09-08 04:39:46,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:46,643 INFO L225 Difference]: With dead ends: 1146 [2019-09-08 04:39:46,643 INFO L226 Difference]: Without dead ends: 616 [2019-09-08 04:39:46,646 INFO L628 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-09-08 04:39:46,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-09-08 04:39:46,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 612. [2019-09-08 04:39:46,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-08 04:39:46,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 847 transitions. [2019-09-08 04:39:46,678 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 847 transitions. Word has length 165 [2019-09-08 04:39:46,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:46,678 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 847 transitions. [2019-09-08 04:39:46,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:39:46,679 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 847 transitions. [2019-09-08 04:39:46,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 04:39:46,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:46,682 INFO L399 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] [2019-09-08 04:39:46,682 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:46,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:46,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1359315355, now seen corresponding path program 1 times [2019-09-08 04:39:46,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:46,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:46,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:46,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 04:39:46,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:46,913 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:39:46,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:46,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:39:46,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:39:46,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:39:46,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:39:46,915 INFO L87 Difference]: Start difference. First operand 612 states and 847 transitions. Second operand 9 states. [2019-09-08 04:39:47,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:47,184 INFO L93 Difference]: Finished difference Result 1151 states and 1608 transitions. [2019-09-08 04:39:47,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:39:47,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 166 [2019-09-08 04:39:47,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:47,189 INFO L225 Difference]: With dead ends: 1151 [2019-09-08 04:39:47,189 INFO L226 Difference]: Without dead ends: 614 [2019-09-08 04:39:47,191 INFO L628 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-09-08 04:39:47,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-08 04:39:47,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 612. [2019-09-08 04:39:47,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-08 04:39:47,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 846 transitions. [2019-09-08 04:39:47,225 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 846 transitions. Word has length 166 [2019-09-08 04:39:47,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:47,226 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 846 transitions. [2019-09-08 04:39:47,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:39:47,226 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 846 transitions. [2019-09-08 04:39:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 04:39:47,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:47,230 INFO L399 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-09-08 04:39:47,230 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:47,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:47,232 INFO L82 PathProgramCache]: Analyzing trace with hash 715061145, now seen corresponding path program 2 times [2019-09-08 04:39:47,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:47,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:47,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:47,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:47,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:39:47,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:47,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:39:47,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:39:47,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:39:47,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:39:47,409 INFO L87 Difference]: Start difference. First operand 612 states and 846 transitions. Second operand 9 states. [2019-09-08 04:39:47,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:47,771 INFO L93 Difference]: Finished difference Result 1153 states and 1609 transitions. [2019-09-08 04:39:47,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:39:47,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-09-08 04:39:47,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:47,776 INFO L225 Difference]: With dead ends: 1153 [2019-09-08 04:39:47,776 INFO L226 Difference]: Without dead ends: 616 [2019-09-08 04:39:47,779 INFO L628 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-09-08 04:39:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-09-08 04:39:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 612. [2019-09-08 04:39:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-08 04:39:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 845 transitions. [2019-09-08 04:39:47,807 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 845 transitions. Word has length 167 [2019-09-08 04:39:47,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:47,807 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 845 transitions. [2019-09-08 04:39:47,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:39:47,808 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 845 transitions. [2019-09-08 04:39:47,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 04:39:47,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:47,812 INFO L399 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-09-08 04:39:47,813 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:47,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:47,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1878162444, now seen corresponding path program 1 times [2019-09-08 04:39:47,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:47,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:47,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:47,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 04:39:47,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:48,045 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:39:48,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:48,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:39:48,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:39:48,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:39:48,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:39:48,047 INFO L87 Difference]: Start difference. First operand 612 states and 845 transitions. Second operand 9 states. [2019-09-08 04:39:48,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:48,497 INFO L93 Difference]: Finished difference Result 1153 states and 1608 transitions. [2019-09-08 04:39:48,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:39:48,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 168 [2019-09-08 04:39:48,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:48,502 INFO L225 Difference]: With dead ends: 1153 [2019-09-08 04:39:48,502 INFO L226 Difference]: Without dead ends: 616 [2019-09-08 04:39:48,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:39:48,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-09-08 04:39:48,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 612. [2019-09-08 04:39:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-08 04:39:48,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 844 transitions. [2019-09-08 04:39:48,534 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 844 transitions. Word has length 168 [2019-09-08 04:39:48,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:48,536 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 844 transitions. [2019-09-08 04:39:48,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:39:48,536 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 844 transitions. [2019-09-08 04:39:48,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 04:39:48,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:48,541 INFO L399 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-09-08 04:39:48,541 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:48,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:48,542 INFO L82 PathProgramCache]: Analyzing trace with hash 519308086, now seen corresponding path program 1 times [2019-09-08 04:39:48,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:48,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:48,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:48,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:48,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:39:49,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:49,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 04:39:49,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 04:39:49,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 04:39:49,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:39:49,001 INFO L87 Difference]: Start difference. First operand 612 states and 844 transitions. Second operand 18 states. [2019-09-08 04:39:53,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:53,555 INFO L93 Difference]: Finished difference Result 1672 states and 2330 transitions. [2019-09-08 04:39:53,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 04:39:53,556 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 168 [2019-09-08 04:39:53,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:53,568 INFO L225 Difference]: With dead ends: 1672 [2019-09-08 04:39:53,568 INFO L226 Difference]: Without dead ends: 1421 [2019-09-08 04:39:53,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1549, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 04:39:53,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2019-09-08 04:39:53,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1398. [2019-09-08 04:39:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1398 states. [2019-09-08 04:39:53,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1966 transitions. [2019-09-08 04:39:53,656 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1966 transitions. Word has length 168 [2019-09-08 04:39:53,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:53,658 INFO L475 AbstractCegarLoop]: Abstraction has 1398 states and 1966 transitions. [2019-09-08 04:39:53,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 04:39:53,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1966 transitions. [2019-09-08 04:39:53,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 04:39:53,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:53,664 INFO L399 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-09-08 04:39:53,664 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:53,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:53,665 INFO L82 PathProgramCache]: Analyzing trace with hash 740768761, now seen corresponding path program 1 times [2019-09-08 04:39:53,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:53,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:53,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:53,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:53,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:54,070 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:39:54,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:54,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:39:54,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:39:54,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:39:54,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:39:54,075 INFO L87 Difference]: Start difference. First operand 1398 states and 1966 transitions. Second operand 12 states. [2019-09-08 04:39:54,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:54,521 INFO L93 Difference]: Finished difference Result 2256 states and 3154 transitions. [2019-09-08 04:39:54,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:39:54,521 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 169 [2019-09-08 04:39:54,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:54,533 INFO L225 Difference]: With dead ends: 2256 [2019-09-08 04:39:54,534 INFO L226 Difference]: Without dead ends: 1488 [2019-09-08 04:39:54,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:39:54,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2019-09-08 04:39:54,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1488. [2019-09-08 04:39:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2019-09-08 04:39:54,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 2107 transitions. [2019-09-08 04:39:54,633 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 2107 transitions. Word has length 169 [2019-09-08 04:39:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:54,633 INFO L475 AbstractCegarLoop]: Abstraction has 1488 states and 2107 transitions. [2019-09-08 04:39:54,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:39:54,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 2107 transitions. [2019-09-08 04:39:54,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 04:39:54,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:54,642 INFO L399 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-09-08 04:39:54,643 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:54,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:54,643 INFO L82 PathProgramCache]: Analyzing trace with hash -639907593, now seen corresponding path program 1 times [2019-09-08 04:39:54,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:54,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:54,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:54,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:54,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:54,937 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:39:54,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:54,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:39:54,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:39:54,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:39:54,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:39:54,940 INFO L87 Difference]: Start difference. First operand 1488 states and 2107 transitions. Second operand 11 states. [2019-09-08 04:39:55,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:55,555 INFO L93 Difference]: Finished difference Result 2307 states and 3219 transitions. [2019-09-08 04:39:55,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:39:55,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 169 [2019-09-08 04:39:55,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:55,573 INFO L225 Difference]: With dead ends: 2307 [2019-09-08 04:39:55,573 INFO L226 Difference]: Without dead ends: 1494 [2019-09-08 04:39:55,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:39:55,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2019-09-08 04:39:55,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1494. [2019-09-08 04:39:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2019-09-08 04:39:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 2114 transitions. [2019-09-08 04:39:55,722 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 2114 transitions. Word has length 169 [2019-09-08 04:39:55,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:55,723 INFO L475 AbstractCegarLoop]: Abstraction has 1494 states and 2114 transitions. [2019-09-08 04:39:55,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:39:55,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 2114 transitions. [2019-09-08 04:39:55,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 04:39:55,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:55,729 INFO L399 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-09-08 04:39:55,729 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:55,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:55,729 INFO L82 PathProgramCache]: Analyzing trace with hash -2088506583, now seen corresponding path program 1 times [2019-09-08 04:39:55,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:55,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:55,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:55,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:55,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:39:55,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:55,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:39:55,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:39:55,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:39:55,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:39:55,925 INFO L87 Difference]: Start difference. First operand 1494 states and 2114 transitions. Second operand 5 states. [2019-09-08 04:39:57,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:57,163 INFO L93 Difference]: Finished difference Result 3730 states and 5251 transitions. [2019-09-08 04:39:57,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:39:57,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2019-09-08 04:39:57,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:57,187 INFO L225 Difference]: With dead ends: 3730 [2019-09-08 04:39:57,188 INFO L226 Difference]: Without dead ends: 3178 [2019-09-08 04:39:57,193 INFO L628 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-09-08 04:39:57,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2019-09-08 04:39:57,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 3164. [2019-09-08 04:39:57,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3164 states. [2019-09-08 04:39:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3164 states to 3164 states and 4471 transitions. [2019-09-08 04:39:57,401 INFO L78 Accepts]: Start accepts. Automaton has 3164 states and 4471 transitions. Word has length 169 [2019-09-08 04:39:57,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:57,402 INFO L475 AbstractCegarLoop]: Abstraction has 3164 states and 4471 transitions. [2019-09-08 04:39:57,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:39:57,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3164 states and 4471 transitions. [2019-09-08 04:39:57,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 04:39:57,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:57,410 INFO L399 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-09-08 04:39:57,410 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:57,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:57,411 INFO L82 PathProgramCache]: Analyzing trace with hash 196356872, now seen corresponding path program 1 times [2019-09-08 04:39:57,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:57,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:57,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:57,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:57,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:57,553 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:57,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:39:57,554 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:39:57,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:39:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:57,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 2646 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:39:58,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:39:58,043 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:39:58,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:39:58,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 04:39:58,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:39:58,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:39:58,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:39:58,058 INFO L87 Difference]: Start difference. First operand 3164 states and 4471 transitions. Second operand 5 states. [2019-09-08 04:39:58,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:58,224 INFO L93 Difference]: Finished difference Result 5538 states and 7722 transitions. [2019-09-08 04:39:58,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:39:58,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2019-09-08 04:39:58,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:58,251 INFO L225 Difference]: With dead ends: 5538 [2019-09-08 04:39:58,251 INFO L226 Difference]: Without dead ends: 3236 [2019-09-08 04:39:58,264 INFO L628 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-09-08 04:39:58,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3236 states. [2019-09-08 04:39:58,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3236 to 3229. [2019-09-08 04:39:58,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3229 states. [2019-09-08 04:39:58,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 4577 transitions. [2019-09-08 04:39:58,479 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 4577 transitions. Word has length 169 [2019-09-08 04:39:58,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:58,480 INFO L475 AbstractCegarLoop]: Abstraction has 3229 states and 4577 transitions. [2019-09-08 04:39:58,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:39:58,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 4577 transitions. [2019-09-08 04:39:58,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 04:39:58,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:58,491 INFO L399 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-09-08 04:39:58,492 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:58,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:58,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1483574261, now seen corresponding path program 1 times [2019-09-08 04:39:58,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:58,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:58,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:58,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:58,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:58,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:58,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:58,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:58,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:58,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:58,612 INFO L87 Difference]: Start difference. First operand 3229 states and 4577 transitions. Second operand 3 states. [2019-09-08 04:39:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:58,740 INFO L93 Difference]: Finished difference Result 6614 states and 9503 transitions. [2019-09-08 04:39:58,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:58,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-08 04:39:58,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:58,765 INFO L225 Difference]: With dead ends: 6614 [2019-09-08 04:39:58,765 INFO L226 Difference]: Without dead ends: 3489 [2019-09-08 04:39:58,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:58,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3489 states. [2019-09-08 04:39:58,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3489 to 3486. [2019-09-08 04:39:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2019-09-08 04:39:59,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 5037 transitions. [2019-09-08 04:39:59,003 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 5037 transitions. Word has length 175 [2019-09-08 04:39:59,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:59,004 INFO L475 AbstractCegarLoop]: Abstraction has 3486 states and 5037 transitions. [2019-09-08 04:39:59,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:59,004 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 5037 transitions. [2019-09-08 04:39:59,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 04:39:59,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:59,018 INFO L399 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-09-08 04:39:59,018 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:59,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:59,019 INFO L82 PathProgramCache]: Analyzing trace with hash -2040481891, now seen corresponding path program 2 times [2019-09-08 04:39:59,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:59,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:59,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:59,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:59,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:59,222 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:59,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:59,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:39:59,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:39:59,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:39:59,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:39:59,225 INFO L87 Difference]: Start difference. First operand 3486 states and 5037 transitions. Second operand 6 states. [2019-09-08 04:39:59,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:59,468 INFO L93 Difference]: Finished difference Result 6819 states and 9870 transitions. [2019-09-08 04:39:59,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:39:59,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-08 04:39:59,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:59,493 INFO L225 Difference]: With dead ends: 6819 [2019-09-08 04:39:59,493 INFO L226 Difference]: Without dead ends: 3489 [2019-09-08 04:39:59,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:39:59,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3489 states. [2019-09-08 04:39:59,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3489 to 3486. [2019-09-08 04:39:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2019-09-08 04:39:59,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 5031 transitions. [2019-09-08 04:39:59,689 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 5031 transitions. Word has length 176 [2019-09-08 04:39:59,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:59,690 INFO L475 AbstractCegarLoop]: Abstraction has 3486 states and 5031 transitions. [2019-09-08 04:39:59,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:39:59,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 5031 transitions. [2019-09-08 04:39:59,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 04:39:59,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:59,701 INFO L399 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-09-08 04:39:59,702 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:59,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:59,702 INFO L82 PathProgramCache]: Analyzing trace with hash -365194644, now seen corresponding path program 1 times [2019-09-08 04:39:59,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:59,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:59,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:59,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 04:39:59,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:59,848 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:59,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:59,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:59,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:59,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:59,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:59,850 INFO L87 Difference]: Start difference. First operand 3486 states and 5031 transitions. Second operand 3 states. [2019-09-08 04:39:59,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:59,980 INFO L93 Difference]: Finished difference Result 7347 states and 10808 transitions. [2019-09-08 04:39:59,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:59,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 04:39:59,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:00,016 INFO L225 Difference]: With dead ends: 7347 [2019-09-08 04:40:00,017 INFO L226 Difference]: Without dead ends: 3971 [2019-09-08 04:40:00,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:00,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3971 states. [2019-09-08 04:40:00,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3971 to 3968. [2019-09-08 04:40:00,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3968 states. [2019-09-08 04:40:00,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 5890 transitions. [2019-09-08 04:40:00,260 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 5890 transitions. Word has length 176 [2019-09-08 04:40:00,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:00,261 INFO L475 AbstractCegarLoop]: Abstraction has 3968 states and 5890 transitions. [2019-09-08 04:40:00,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:40:00,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 5890 transitions. [2019-09-08 04:40:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 04:40:00,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:00,282 INFO L399 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-09-08 04:40:00,282 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:00,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:00,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1157622029, now seen corresponding path program 1 times [2019-09-08 04:40:00,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:00,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:00,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:00,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:00,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:40:00,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:00,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:40:00,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:40:00,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:40:00,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:00,459 INFO L87 Difference]: Start difference. First operand 3968 states and 5890 transitions. Second operand 3 states. [2019-09-08 04:40:00,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:00,712 INFO L93 Difference]: Finished difference Result 8751 states and 13292 transitions. [2019-09-08 04:40:00,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:40:00,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-09-08 04:40:00,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:00,737 INFO L225 Difference]: With dead ends: 8751 [2019-09-08 04:40:00,737 INFO L226 Difference]: Without dead ends: 4901 [2019-09-08 04:40:00,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4901 states. [2019-09-08 04:40:00,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4901 to 4898. [2019-09-08 04:40:00,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4898 states. [2019-09-08 04:40:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4898 states to 4898 states and 7515 transitions. [2019-09-08 04:40:00,989 INFO L78 Accepts]: Start accepts. Automaton has 4898 states and 7515 transitions. Word has length 177 [2019-09-08 04:40:00,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:00,990 INFO L475 AbstractCegarLoop]: Abstraction has 4898 states and 7515 transitions. [2019-09-08 04:40:00,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:40:00,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4898 states and 7515 transitions. [2019-09-08 04:40:01,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 04:40:01,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:01,010 INFO L399 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-09-08 04:40:01,011 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:01,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:01,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1930087660, now seen corresponding path program 1 times [2019-09-08 04:40:01,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:01,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:01,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:01,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:01,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:01,122 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:40:01,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:01,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:40:01,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:40:01,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:40:01,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:01,125 INFO L87 Difference]: Start difference. First operand 4898 states and 7515 transitions. Second operand 3 states. [2019-09-08 04:40:01,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:01,350 INFO L93 Difference]: Finished difference Result 11451 states and 18002 transitions. [2019-09-08 04:40:01,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:40:01,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-08 04:40:01,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:01,391 INFO L225 Difference]: With dead ends: 11451 [2019-09-08 04:40:01,392 INFO L226 Difference]: Without dead ends: 6683 [2019-09-08 04:40:01,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:01,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6683 states. [2019-09-08 04:40:01,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6683 to 6680. [2019-09-08 04:40:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6680 states. [2019-09-08 04:40:01,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6680 states to 6680 states and 10592 transitions. [2019-09-08 04:40:01,736 INFO L78 Accepts]: Start accepts. Automaton has 6680 states and 10592 transitions. Word has length 178 [2019-09-08 04:40:01,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:01,736 INFO L475 AbstractCegarLoop]: Abstraction has 6680 states and 10592 transitions. [2019-09-08 04:40:01,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:40:01,737 INFO L276 IsEmpty]: Start isEmpty. Operand 6680 states and 10592 transitions. [2019-09-08 04:40:01,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 04:40:01,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:01,767 INFO L399 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-09-08 04:40:01,767 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:01,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:01,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1656861325, now seen corresponding path program 1 times [2019-09-08 04:40:01,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:01,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:01,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:01,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:01,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:01,992 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:40:01,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:01,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:40:01,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:40:01,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:40:01,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:01,993 INFO L87 Difference]: Start difference. First operand 6680 states and 10592 transitions. Second operand 3 states. [2019-09-08 04:40:02,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:02,302 INFO L93 Difference]: Finished difference Result 16633 states and 27020 transitions. [2019-09-08 04:40:02,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:40:02,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-08 04:40:02,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:02,348 INFO L225 Difference]: With dead ends: 16633 [2019-09-08 04:40:02,349 INFO L226 Difference]: Without dead ends: 10093 [2019-09-08 04:40:02,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:02,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2019-09-08 04:40:02,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 10090. [2019-09-08 04:40:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10090 states. [2019-09-08 04:40:03,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10090 states to 10090 states and 16497 transitions. [2019-09-08 04:40:03,007 INFO L78 Accepts]: Start accepts. Automaton has 10090 states and 16497 transitions. Word has length 179 [2019-09-08 04:40:03,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:03,007 INFO L475 AbstractCegarLoop]: Abstraction has 10090 states and 16497 transitions. [2019-09-08 04:40:03,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:40:03,008 INFO L276 IsEmpty]: Start isEmpty. Operand 10090 states and 16497 transitions. [2019-09-08 04:40:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 04:40:03,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:03,062 INFO L399 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-09-08 04:40:03,062 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:03,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:03,063 INFO L82 PathProgramCache]: Analyzing trace with hash 718405484, now seen corresponding path program 1 times [2019-09-08 04:40:03,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:03,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:03,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:03,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:03,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:03,192 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:40:03,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:03,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:40:03,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:40:03,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:40:03,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:03,195 INFO L87 Difference]: Start difference. First operand 10090 states and 16497 transitions. Second operand 3 states. [2019-09-08 04:40:03,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:03,806 INFO L93 Difference]: Finished difference Result 26567 states and 44246 transitions. [2019-09-08 04:40:03,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:40:03,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 04:40:03,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:03,879 INFO L225 Difference]: With dead ends: 26567 [2019-09-08 04:40:03,879 INFO L226 Difference]: Without dead ends: 16623 [2019-09-08 04:40:03,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:03,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16623 states. [2019-09-08 04:40:05,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16623 to 16620. [2019-09-08 04:40:05,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16620 states. [2019-09-08 04:40:05,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16620 states to 16620 states and 27730 transitions. [2019-09-08 04:40:05,898 INFO L78 Accepts]: Start accepts. Automaton has 16620 states and 27730 transitions. Word has length 180 [2019-09-08 04:40:05,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:05,899 INFO L475 AbstractCegarLoop]: Abstraction has 16620 states and 27730 transitions. [2019-09-08 04:40:05,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:40:05,899 INFO L276 IsEmpty]: Start isEmpty. Operand 16620 states and 27730 transitions. [2019-09-08 04:40:05,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 04:40:05,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:05,950 INFO L399 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-09-08 04:40:05,951 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:05,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:05,951 INFO L82 PathProgramCache]: Analyzing trace with hash -614427163, now seen corresponding path program 1 times [2019-09-08 04:40:05,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:05,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:05,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:05,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:05,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:06,086 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 04:40:06,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:40:06,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:40:06,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:40:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:06,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 2710 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:40:06,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:40:06,513 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): Broken pipe [2019-09-08 04:40:06,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:40:06,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 04:40:06,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:40:06,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:40:06,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:40:06,529 INFO L87 Difference]: Start difference. First operand 16620 states and 27730 transitions. Second operand 6 states. [2019-09-08 04:40:07,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:07,353 INFO L93 Difference]: Finished difference Result 19842 states and 32335 transitions. [2019-09-08 04:40:07,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:40:07,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 187 [2019-09-08 04:40:07,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:07,417 INFO L225 Difference]: With dead ends: 19842 [2019-09-08 04:40:07,417 INFO L226 Difference]: Without dead ends: 17540 [2019-09-08 04:40:07,429 INFO L628 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-09-08 04:40:07,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17540 states. [2019-09-08 04:40:08,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17540 to 17461. [2019-09-08 04:40:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17461 states. [2019-09-08 04:40:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17461 states to 17461 states and 29049 transitions. [2019-09-08 04:40:08,307 INFO L78 Accepts]: Start accepts. Automaton has 17461 states and 29049 transitions. Word has length 187 [2019-09-08 04:40:08,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:08,308 INFO L475 AbstractCegarLoop]: Abstraction has 17461 states and 29049 transitions. [2019-09-08 04:40:08,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:40:08,308 INFO L276 IsEmpty]: Start isEmpty. Operand 17461 states and 29049 transitions. [2019-09-08 04:40:08,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 04:40:08,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:08,366 INFO L399 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-09-08 04:40:08,366 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:08,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:08,367 INFO L82 PathProgramCache]: Analyzing trace with hash -144210931, now seen corresponding path program 1 times [2019-09-08 04:40:08,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:08,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:08,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:08,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:08,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:08,474 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:40:08,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:08,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:40:08,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:40:08,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:40:08,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:08,480 INFO L87 Difference]: Start difference. First operand 17461 states and 29049 transitions. Second operand 3 states. [2019-09-08 04:40:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:09,617 INFO L93 Difference]: Finished difference Result 46845 states and 79000 transitions. [2019-09-08 04:40:09,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:40:09,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-08 04:40:09,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:09,762 INFO L225 Difference]: With dead ends: 46845 [2019-09-08 04:40:09,763 INFO L226 Difference]: Without dead ends: 30028 [2019-09-08 04:40:09,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:09,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30028 states. [2019-09-08 04:40:11,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30028 to 30025. [2019-09-08 04:40:11,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30025 states. [2019-09-08 04:40:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30025 states to 30025 states and 50461 transitions. [2019-09-08 04:40:11,399 INFO L78 Accepts]: Start accepts. Automaton has 30025 states and 50461 transitions. Word has length 181 [2019-09-08 04:40:11,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:11,400 INFO L475 AbstractCegarLoop]: Abstraction has 30025 states and 50461 transitions. [2019-09-08 04:40:11,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:40:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand 30025 states and 50461 transitions. [2019-09-08 04:40:11,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 04:40:11,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:11,455 INFO L399 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-09-08 04:40:11,455 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:11,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:11,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1313265172, now seen corresponding path program 1 times [2019-09-08 04:40:11,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:11,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:11,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:11,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:11,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:11,583 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:40:11,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:11,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:40:11,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:40:11,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:40:11,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:11,584 INFO L87 Difference]: Start difference. First operand 30025 states and 50461 transitions. Second operand 3 states. [2019-09-08 04:40:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:13,835 INFO L93 Difference]: Finished difference Result 83263 states and 140383 transitions. [2019-09-08 04:40:13,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:40:13,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-08 04:40:13,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:14,062 INFO L225 Difference]: With dead ends: 83263 [2019-09-08 04:40:14,063 INFO L226 Difference]: Without dead ends: 54016 [2019-09-08 04:40:14,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54016 states. [2019-09-08 04:40:16,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54016 to 54013. [2019-09-08 04:40:16,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54013 states. [2019-09-08 04:40:16,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54013 states to 54013 states and 90253 transitions. [2019-09-08 04:40:16,672 INFO L78 Accepts]: Start accepts. Automaton has 54013 states and 90253 transitions. Word has length 182 [2019-09-08 04:40:16,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:16,673 INFO L475 AbstractCegarLoop]: Abstraction has 54013 states and 90253 transitions. [2019-09-08 04:40:16,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:40:16,673 INFO L276 IsEmpty]: Start isEmpty. Operand 54013 states and 90253 transitions. [2019-09-08 04:40:16,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 04:40:16,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:16,726 INFO L399 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-09-08 04:40:16,727 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:16,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:16,727 INFO L82 PathProgramCache]: Analyzing trace with hash 2064211341, now seen corresponding path program 1 times [2019-09-08 04:40:16,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:16,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:16,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:16,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:16,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:40:16,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:16,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:40:16,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:40:16,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:40:16,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:16,841 INFO L87 Difference]: Start difference. First operand 54013 states and 90253 transitions. Second operand 3 states. [2019-09-08 04:40:21,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:21,764 INFO L93 Difference]: Finished difference Result 152433 states and 255994 transitions. [2019-09-08 04:40:21,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:40:21,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-08 04:40:21,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:22,121 INFO L225 Difference]: With dead ends: 152433 [2019-09-08 04:40:22,122 INFO L226 Difference]: Without dead ends: 99420 [2019-09-08 04:40:22,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99420 states. [2019-09-08 04:40:28,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99420 to 99417. [2019-09-08 04:40:28,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99417 states. [2019-09-08 04:40:28,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99417 states to 99417 states and 165619 transitions. [2019-09-08 04:40:28,431 INFO L78 Accepts]: Start accepts. Automaton has 99417 states and 165619 transitions. Word has length 183 [2019-09-08 04:40:28,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:28,432 INFO L475 AbstractCegarLoop]: Abstraction has 99417 states and 165619 transitions. [2019-09-08 04:40:28,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:40:28,432 INFO L276 IsEmpty]: Start isEmpty. Operand 99417 states and 165619 transitions. [2019-09-08 04:40:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 04:40:28,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:28,496 INFO L399 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-09-08 04:40:28,496 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:28,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:28,496 INFO L82 PathProgramCache]: Analyzing trace with hash 392711276, now seen corresponding path program 1 times [2019-09-08 04:40:28,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:28,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:28,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:28,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:28,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:28,627 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:40:28,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:28,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:40:28,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:40:28,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:40:28,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:28,630 INFO L87 Difference]: Start difference. First operand 99417 states and 165619 transitions. Second operand 3 states. [2019-09-08 04:40:35,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:35,791 INFO L93 Difference]: Finished difference Result 187900 states and 310297 transitions. [2019-09-08 04:40:35,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:40:35,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-09-08 04:40:35,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:36,303 INFO L225 Difference]: With dead ends: 187900 [2019-09-08 04:40:36,303 INFO L226 Difference]: Without dead ends: 185598 [2019-09-08 04:40:36,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:36,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185598 states. [2019-09-08 04:40:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185598 to 185595. [2019-09-08 04:40:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185595 states. [2019-09-08 04:40:47,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185595 states to 185595 states and 304068 transitions. [2019-09-08 04:40:47,376 INFO L78 Accepts]: Start accepts. Automaton has 185595 states and 304068 transitions. Word has length 184 [2019-09-08 04:40:47,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:47,376 INFO L475 AbstractCegarLoop]: Abstraction has 185595 states and 304068 transitions. [2019-09-08 04:40:47,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:40:47,376 INFO L276 IsEmpty]: Start isEmpty. Operand 185595 states and 304068 transitions. [2019-09-08 04:40:47,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 04:40:47,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:47,476 INFO L399 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-09-08 04:40:47,476 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:47,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:47,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1237369075, now seen corresponding path program 1 times [2019-09-08 04:40:47,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:47,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:47,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:47,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:47,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:40:48,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:48,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:40:48,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:40:48,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:40:48,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:48,097 INFO L87 Difference]: Start difference. First operand 185595 states and 304068 transitions. Second operand 3 states. [2019-09-08 04:40:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:58,605 INFO L93 Difference]: Finished difference Result 188387 states and 307908 transitions. [2019-09-08 04:40:58,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:40:58,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-08 04:40:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:59,379 INFO L225 Difference]: With dead ends: 188387 [2019-09-08 04:40:59,380 INFO L226 Difference]: Without dead ends: 186140 [2019-09-08 04:40:59,454 INFO L628 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-09-08 04:40:59,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186140 states. [2019-09-08 04:41:07,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186140 to 186140. [2019-09-08 04:41:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186140 states. [2019-09-08 04:41:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186140 states to 186140 states and 304800 transitions. [2019-09-08 04:41:07,527 INFO L78 Accepts]: Start accepts. Automaton has 186140 states and 304800 transitions. Word has length 185 [2019-09-08 04:41:07,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:41:07,527 INFO L475 AbstractCegarLoop]: Abstraction has 186140 states and 304800 transitions. [2019-09-08 04:41:07,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:41:07,527 INFO L276 IsEmpty]: Start isEmpty. Operand 186140 states and 304800 transitions. [2019-09-08 04:41:08,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 04:41:08,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:41:08,161 INFO L399 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-09-08 04:41:08,161 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:41:08,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:41:08,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1385786655, now seen corresponding path program 1 times [2019-09-08 04:41:08,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:41:08,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:41:08,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:41:08,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:41:08,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:41:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:41:09,243 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 04:41:09,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:41:09,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:41:09,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:41:09,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:41:09,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:41:09,245 INFO L87 Difference]: Start difference. First operand 186140 states and 304800 transitions. Second operand 6 states. [2019-09-08 04:41:23,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:41:23,091 INFO L93 Difference]: Finished difference Result 365882 states and 602075 transitions. [2019-09-08 04:41:23,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:41:23,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 306 [2019-09-08 04:41:23,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:41:24,982 INFO L225 Difference]: With dead ends: 365882 [2019-09-08 04:41:24,982 INFO L226 Difference]: Without dead ends: 363139 [2019-09-08 04:41:25,083 INFO L628 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-09-08 04:41:25,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363139 states. [2019-09-08 04:41:54,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363139 to 363076. [2019-09-08 04:41:54,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363076 states. [2019-09-08 04:41:54,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363076 states to 363076 states and 598272 transitions. [2019-09-08 04:41:54,880 INFO L78 Accepts]: Start accepts. Automaton has 363076 states and 598272 transitions. Word has length 306 [2019-09-08 04:41:54,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:41:54,881 INFO L475 AbstractCegarLoop]: Abstraction has 363076 states and 598272 transitions. [2019-09-08 04:41:54,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:41:54,881 INFO L276 IsEmpty]: Start isEmpty. Operand 363076 states and 598272 transitions. [2019-09-08 04:42:03,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-08 04:42:03,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:42:03,636 INFO L399 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-09-08 04:42:03,636 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:42:03,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:42:03,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1935798206, now seen corresponding path program 1 times [2019-09-08 04:42:03,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:42:03,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:42:03,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:42:03,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:42:03,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:42:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:42:03,845 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 04:42:03,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:42:03,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:42:03,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:42:03,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:42:03,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:42:03,847 INFO L87 Difference]: Start difference. First operand 363076 states and 598272 transitions. Second operand 9 states. [2019-09-08 04:42:15,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:42:15,654 INFO L93 Difference]: Finished difference Result 368429 states and 605429 transitions. [2019-09-08 04:42:15,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:42:15,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 307 [2019-09-08 04:42:15,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:42:16,568 INFO L225 Difference]: With dead ends: 368429 [2019-09-08 04:42:16,569 INFO L226 Difference]: Without dead ends: 362824 [2019-09-08 04:42:16,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:42:16,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362824 states. [2019-09-08 04:42:44,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362824 to 362768. [2019-09-08 04:42:44,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362768 states. [2019-09-08 04:42:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362768 states to 362768 states and 597732 transitions. [2019-09-08 04:42:46,029 INFO L78 Accepts]: Start accepts. Automaton has 362768 states and 597732 transitions. Word has length 307 [2019-09-08 04:42:46,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:42:46,029 INFO L475 AbstractCegarLoop]: Abstraction has 362768 states and 597732 transitions. [2019-09-08 04:42:46,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:42:46,030 INFO L276 IsEmpty]: Start isEmpty. Operand 362768 states and 597732 transitions. [2019-09-08 04:42:47,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-08 04:42:47,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:42:47,470 INFO L399 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-09-08 04:42:47,470 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:42:47,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:42:47,470 INFO L82 PathProgramCache]: Analyzing trace with hash -2107964377, now seen corresponding path program 1 times [2019-09-08 04:42:47,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:42:47,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:42:47,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:42:47,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:42:47,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:42:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:42:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-08 04:42:47,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:42:47,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:42:47,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:42:47,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:42:47,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:42:47,630 INFO L87 Difference]: Start difference. First operand 362768 states and 597732 transitions. Second operand 5 states. [2019-09-08 04:43:04,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:43:04,495 INFO L93 Difference]: Finished difference Result 365844 states and 601777 transitions. [2019-09-08 04:43:04,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:43:04,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 299 [2019-09-08 04:43:04,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:43:06,304 INFO L225 Difference]: With dead ends: 365844 [2019-09-08 04:43:06,305 INFO L226 Difference]: Without dead ends: 362528 [2019-09-08 04:43:06,405 INFO L628 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-09-08 04:43:06,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362528 states. [2019-09-08 04:43:32,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362528 to 361946. [2019-09-08 04:43:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361946 states. [2019-09-08 04:43:40,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361946 states to 361946 states and 596625 transitions. [2019-09-08 04:43:40,598 INFO L78 Accepts]: Start accepts. Automaton has 361946 states and 596625 transitions. Word has length 299 [2019-09-08 04:43:40,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:43:40,599 INFO L475 AbstractCegarLoop]: Abstraction has 361946 states and 596625 transitions. [2019-09-08 04:43:40,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:43:40,599 INFO L276 IsEmpty]: Start isEmpty. Operand 361946 states and 596625 transitions. [2019-09-08 04:43:41,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-08 04:43:41,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:43:41,885 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:43:41,886 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:43:41,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:43:41,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1366769177, now seen corresponding path program 1 times [2019-09-08 04:43:41,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:43:41,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:43:41,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:43:41,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:43:41,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:43:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:43:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-08 04:43:42,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:43:42,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:43:42,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:43:42,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:43:42,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:43:42,191 INFO L87 Difference]: Start difference. First operand 361946 states and 596625 transitions. Second operand 11 states. [2019-09-08 04:44:02,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:44:02,047 INFO L93 Difference]: Finished difference Result 368141 states and 604896 transitions. [2019-09-08 04:44:02,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:44:02,048 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 300 [2019-09-08 04:44:02,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:44:04,154 INFO L225 Difference]: With dead ends: 368141 [2019-09-08 04:44:04,154 INFO L226 Difference]: Without dead ends: 364447 [2019-09-08 04:44:04,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:44:04,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364447 states. [2019-09-08 04:44:31,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364447 to 364338. [2019-09-08 04:44:31,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364338 states. [2019-09-08 04:44:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364338 states to 364338 states and 599786 transitions. [2019-09-08 04:44:33,626 INFO L78 Accepts]: Start accepts. Automaton has 364338 states and 599786 transitions. Word has length 300 [2019-09-08 04:44:33,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:44:33,627 INFO L475 AbstractCegarLoop]: Abstraction has 364338 states and 599786 transitions. [2019-09-08 04:44:33,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:44:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 364338 states and 599786 transitions. [2019-09-08 04:44:35,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-08 04:44:35,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:44:35,084 INFO L399 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-09-08 04:44:35,084 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:44:35,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:44:35,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1814803901, now seen corresponding path program 1 times [2019-09-08 04:44:35,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:44:35,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:44:35,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:44:35,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:44:35,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:44:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:44:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-08 04:44:35,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:44:35,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:44:35,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:44:35,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:44:35,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:44:35,276 INFO L87 Difference]: Start difference. First operand 364338 states and 599786 transitions. Second operand 7 states. [2019-09-08 04:44:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:44:58,674 INFO L93 Difference]: Finished difference Result 719479 states and 1194436 transitions. [2019-09-08 04:44:58,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:44:58,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 352 [2019-09-08 04:44:58,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:45:07,448 INFO L225 Difference]: With dead ends: 719479 [2019-09-08 04:45:07,449 INFO L226 Difference]: Without dead ends: 364392 [2019-09-08 04:45:07,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:45:08,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364392 states. [2019-09-08 04:45:28,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364392 to 364392. [2019-09-08 04:45:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364392 states. [2019-09-08 04:45:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364392 states to 364392 states and 599852 transitions. [2019-09-08 04:45:29,346 INFO L78 Accepts]: Start accepts. Automaton has 364392 states and 599852 transitions. Word has length 352 [2019-09-08 04:45:29,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:45:29,347 INFO L475 AbstractCegarLoop]: Abstraction has 364392 states and 599852 transitions. [2019-09-08 04:45:29,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:45:29,348 INFO L276 IsEmpty]: Start isEmpty. Operand 364392 states and 599852 transitions. [2019-09-08 04:45:41,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-08 04:45:41,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:45:41,730 INFO L399 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-09-08 04:45:41,730 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:45:41,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:45:41,730 INFO L82 PathProgramCache]: Analyzing trace with hash -852981930, now seen corresponding path program 1 times [2019-09-08 04:45:41,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:45:41,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:45:41,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:41,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:45:41,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:45:41,936 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-08 04:45:41,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:45:41,937 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:45:41,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:45:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:45:42,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 3647 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 04:45:42,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:45:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-08 04:45:42,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:45:42,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-09-08 04:45:42,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:45:42,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:45:42,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:45:42,617 INFO L87 Difference]: Start difference. First operand 364392 states and 599852 transitions. Second operand 11 states. [2019-09-08 04:45:56,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:45:56,183 INFO L93 Difference]: Finished difference Result 381457 states and 625268 transitions. [2019-09-08 04:45:56,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:45:56,184 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 353 [2019-09-08 04:45:56,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:45:58,089 INFO L225 Difference]: With dead ends: 381457 [2019-09-08 04:45:58,089 INFO L226 Difference]: Without dead ends: 374446 [2019-09-08 04:45:58,181 INFO L628 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-09-08 04:45:58,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374446 states. [2019-09-08 04:46:26,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374446 to 374435. [2019-09-08 04:46:26,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374435 states. [2019-09-08 04:46:27,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374435 states to 374435 states and 614950 transitions. [2019-09-08 04:46:27,578 INFO L78 Accepts]: Start accepts. Automaton has 374435 states and 614950 transitions. Word has length 353 [2019-09-08 04:46:27,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:46:27,578 INFO L475 AbstractCegarLoop]: Abstraction has 374435 states and 614950 transitions. [2019-09-08 04:46:27,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:46:27,579 INFO L276 IsEmpty]: Start isEmpty. Operand 374435 states and 614950 transitions. [2019-09-08 04:46:30,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 04:46:30,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:46:30,514 INFO L399 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-09-08 04:46:30,514 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:46:30,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:46:30,514 INFO L82 PathProgramCache]: Analyzing trace with hash 709921390, now seen corresponding path program 1 times [2019-09-08 04:46:30,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:46:30,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:46:30,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:30,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:46:30,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-08 04:46:30,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:46:30,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:46:30,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:46:30,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:46:30,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:46:30,670 INFO L87 Difference]: Start difference. First operand 374435 states and 614950 transitions. Second operand 6 states. [2019-09-08 04:46:54,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:46:54,571 INFO L93 Difference]: Finished difference Result 738660 states and 1214505 transitions. [2019-09-08 04:46:54,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:46:54,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 372 [2019-09-08 04:46:54,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:46:55,950 INFO L225 Difference]: With dead ends: 738660 [2019-09-08 04:46:55,951 INFO L226 Difference]: Without dead ends: 374441 [2019-09-08 04:46:56,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:46:56,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374441 states. [2019-09-08 04:47:25,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374441 to 374435. [2019-09-08 04:47:25,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374435 states. [2019-09-08 04:47:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374435 states to 374435 states and 608973 transitions. [2019-09-08 04:47:27,284 INFO L78 Accepts]: Start accepts. Automaton has 374435 states and 608973 transitions. Word has length 372 [2019-09-08 04:47:27,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:47:27,284 INFO L475 AbstractCegarLoop]: Abstraction has 374435 states and 608973 transitions. [2019-09-08 04:47:27,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:47:27,285 INFO L276 IsEmpty]: Start isEmpty. Operand 374435 states and 608973 transitions. [2019-09-08 04:47:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 04:47:29,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:47:29,031 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:47:29,031 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:47:29,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:47:29,032 INFO L82 PathProgramCache]: Analyzing trace with hash 913972512, now seen corresponding path program 1 times [2019-09-08 04:47:29,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:47:29,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:47:29,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:47:29,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:47:29,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:47:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:47:29,299 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-09-08 04:47:29,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:47:29,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:47:29,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:47:29,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:47:29,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:47:29,301 INFO L87 Difference]: Start difference. First operand 374435 states and 608973 transitions. Second operand 8 states. [2019-09-08 04:48:23,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:48:23,269 INFO L93 Difference]: Finished difference Result 1121529 states and 2072383 transitions. [2019-09-08 04:48:23,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:48:23,270 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 391 [2019-09-08 04:48:23,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:48:26,341 INFO L225 Difference]: With dead ends: 1121529 [2019-09-08 04:48:26,341 INFO L226 Difference]: Without dead ends: 748354 [2019-09-08 04:48:27,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:48:27,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748354 states.