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_spec6_product15.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:38:03,436 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:38:03,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:38:03,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:38:03,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:38:03,452 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:38:03,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:38:03,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:38:03,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:38:03,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:38:03,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:38:03,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:38:03,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:38:03,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:38:03,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:38:03,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:38:03,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:38:03,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:38:03,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:38:03,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:38:03,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:38:03,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:38:03,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:38:03,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:38:03,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:38:03,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:38:03,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:38:03,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:38:03,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:38:03,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:38:03,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:38:03,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:38:03,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:38:03,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:38:03,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:38:03,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:38:03,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:38:03,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:38:03,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:38:03,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:38:03,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:38:03,494 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 13:38:03,522 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:38:03,522 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:38:03,523 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:38:03,524 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:38:03,524 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:38:03,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:38:03,524 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:38:03,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:38:03,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:38:03,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:38:03,525 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:38:03,525 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:38:03,526 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:38:03,526 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:38:03,526 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:38:03,526 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:38:03,526 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:38:03,527 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:38:03,527 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:38:03,527 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:38:03,527 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:38:03,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:38:03,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:38:03,528 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:38:03,528 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:38:03,528 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:38:03,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:38:03,529 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:38:03,529 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:38:03,575 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:38:03,586 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:38:03,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:38:03,590 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:38:03,591 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:38:03,591 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec6_product15.cil.c [2019-10-02 13:38:03,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4ae9a780/355c26aaf0384a2a93e65cd691dafe25/FLAGd9e246f91 [2019-10-02 13:38:04,276 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:38:04,277 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec6_product15.cil.c [2019-10-02 13:38:04,298 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4ae9a780/355c26aaf0384a2a93e65cd691dafe25/FLAGd9e246f91 [2019-10-02 13:38:04,513 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4ae9a780/355c26aaf0384a2a93e65cd691dafe25 [2019-10-02 13:38:04,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:38:04,526 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:38:04,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:38:04,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:38:04,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:38:04,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:38:04" (1/1) ... [2019-10-02 13:38:04,535 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11498c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:38:04, skipping insertion in model container [2019-10-02 13:38:04,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:38:04" (1/1) ... [2019-10-02 13:38:04,543 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:38:04,641 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:38:05,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:38:05,401 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:38:05,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:38:05,676 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:38:05,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:38:05 WrapperNode [2019-10-02 13:38:05,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:38:05,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:38:05,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:38:05,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:38:05,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:38:05" (1/1) ... [2019-10-02 13:38:05,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:38:05" (1/1) ... [2019-10-02 13:38:05,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:38:05" (1/1) ... [2019-10-02 13:38:05,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:38:05" (1/1) ... [2019-10-02 13:38:05,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:38:05" (1/1) ... [2019-10-02 13:38:05,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:38:05" (1/1) ... [2019-10-02 13:38:05,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:38:05" (1/1) ... [2019-10-02 13:38:05,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:38:05,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:38:05,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:38:05,893 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:38:05,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:38:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:38:05,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:38:05,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:38:05,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:38:05,965 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:38:05,966 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:38:05,967 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:38:05,967 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:38:05,967 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:38:05,967 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:38:05,968 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 13:38:05,968 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AutoResponder [2019-10-02 13:38:05,969 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:38:05,969 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:38:05,970 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:38:05,971 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:38:05,971 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:38:05,975 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:38:05,975 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:38:05,975 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:38:05,976 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:38:05,976 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 13:38:05,976 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:38:05,977 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:38:05,977 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:38:05,977 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:38:05,977 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:38:05,978 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:38:05,978 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:38:05,978 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:38:05,978 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:38:05,979 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:38:05,979 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:38:05,980 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:38:05,980 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:38:05,980 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:38:05,980 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:38:05,981 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:38:05,981 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:38:05,981 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:38:05,981 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:38:05,982 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:38:05,982 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:38:05,982 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:38:05,982 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:38:05,983 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:38:05,983 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:38:05,984 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:38:05,984 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:38:05,984 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:38:05,985 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:38:05,985 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:38:05,985 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:38:05,985 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:38:05,986 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:38:05,986 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:38:05,986 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:38:05,986 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:38:05,987 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:38:05,987 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:38:05,987 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:38:05,987 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:38:05,987 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:38:05,988 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:38:05,988 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:38:05,988 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:38:05,988 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:38:05,988 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:38:05,989 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:38:05,989 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:38:05,989 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:38:05,990 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:38:05,990 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:38:05,990 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:38:05,990 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:38:05,991 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:38:05,991 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:38:05,991 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:38:05,992 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:38:05,992 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:38:05,992 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:38:05,992 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:38:05,992 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:38:05,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-10-02 13:38:05,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-10-02 13:38:05,993 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:38:05,994 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:38:05,994 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:38:05,995 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:38:05,995 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:38:05,995 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:38:05,996 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:38:05,996 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:38:05,996 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:38:05,997 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:38:05,997 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:38:05,997 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:38:05,997 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:38:05,998 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:38:05,998 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:38:05,998 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:38:05,998 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:38:05,999 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:38:05,999 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:38:05,999 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 13:38:05,999 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:38:05,999 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:38:06,000 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:38:06,000 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:38:06,000 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:38:06,001 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:38:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:38:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:38:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:38:06,002 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 13:38:06,002 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:38:06,002 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:38:06,003 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:38:06,003 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:38:06,003 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:38:06,003 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:38:06,004 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:38:06,004 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:38:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:38:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:38:06,006 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:38:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:38:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:38:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:38:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:38:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:38:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:38:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:38:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:38:06,009 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:38:06,009 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:38:06,009 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:38:06,009 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:38:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:38:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:38:06,011 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:38:06,015 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:38:06,015 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:38:06,016 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:38:06,016 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:38:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:38:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:38:06,024 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:38:06,024 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:38:06,025 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:38:06,025 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:38:06,025 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:38:06,026 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:38:06,026 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 13:38:06,026 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-10-02 13:38:06,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:38:06,026 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:38:06,027 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 13:38:06,027 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AutoResponder [2019-10-02 13:38:06,027 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-10-02 13:38:06,027 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:38:06,028 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:38:06,028 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:38:06,028 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:38:06,028 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:38:06,028 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:38:06,028 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:38:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:38:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:38:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:38:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:38:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:38:06,030 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:38:06,030 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:38:06,030 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:38:06,030 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:38:06,030 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:38:06,031 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:38:06,031 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:38:06,031 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:38:06,031 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:38:06,031 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:38:06,032 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:38:06,032 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:38:06,032 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:38:06,032 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:38:06,032 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:38:06,033 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:38:06,033 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:38:06,033 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:38:06,033 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:38:06,034 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:38:06,034 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:38:06,034 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:38:06,034 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:38:06,034 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:38:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:38:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:38:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:38:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:38:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:38:06,036 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:38:06,036 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:38:06,036 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:38:06,036 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:38:06,036 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:38:06,036 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:38:06,036 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:38:06,036 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:38:06,037 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:38:06,037 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:38:06,037 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:38:06,037 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:38:06,037 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:38:06,037 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:38:06,037 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:38:06,038 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:38:06,038 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:38:06,038 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:38:06,038 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:38:06,038 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:38:06,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:38:06,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:38:06,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:38:06,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:38:06,039 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:38:06,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:38:06,039 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:38:06,039 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:38:06,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:38:06,040 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:38:06,040 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:38:06,040 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:38:06,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:38:06,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:38:06,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:38:08,154 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:38:08,155 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:38:08,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:38:08 BoogieIcfgContainer [2019-10-02 13:38:08,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:38:08,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:38:08,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:38:08,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:38:08,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:38:04" (1/3) ... [2019-10-02 13:38:08,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767a4ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:38:08, skipping insertion in model container [2019-10-02 13:38:08,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:38:05" (2/3) ... [2019-10-02 13:38:08,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767a4ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:38:08, skipping insertion in model container [2019-10-02 13:38:08,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:38:08" (3/3) ... [2019-10-02 13:38:08,165 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec6_product15.cil.c [2019-10-02 13:38:08,175 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:38:08,185 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:38:08,202 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:38:08,237 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:38:08,237 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:38:08,238 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:38:08,238 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:38:08,238 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:38:08,238 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:38:08,238 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:38:08,238 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:38:08,238 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:38:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states. [2019-10-02 13:38:08,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 13:38:08,292 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:38:08,293 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:38:08,296 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:38:08,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:38:08,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1208653577, now seen corresponding path program 1 times [2019-10-02 13:38:08,305 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:38:08,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:38:08,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:08,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:38:08,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:38:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:38:08,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:38:08,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:38:08,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:38:08,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:38:08,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:38:08,991 INFO L87 Difference]: Start difference. First operand 474 states. Second operand 2 states. [2019-10-02 13:38:09,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:38:09,083 INFO L93 Difference]: Finished difference Result 642 states and 852 transitions. [2019-10-02 13:38:09,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:38:09,084 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 176 [2019-10-02 13:38:09,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:38:09,119 INFO L225 Difference]: With dead ends: 642 [2019-10-02 13:38:09,119 INFO L226 Difference]: Without dead ends: 427 [2019-10-02 13:38:09,129 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:38:09,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-10-02 13:38:09,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2019-10-02 13:38:09,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-10-02 13:38:09,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 570 transitions. [2019-10-02 13:38:09,256 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 570 transitions. Word has length 176 [2019-10-02 13:38:09,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:38:09,260 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 570 transitions. [2019-10-02 13:38:09,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:38:09,261 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 570 transitions. [2019-10-02 13:38:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 13:38:09,275 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:38:09,276 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:38:09,276 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:38:09,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:38:09,277 INFO L82 PathProgramCache]: Analyzing trace with hash -819004996, now seen corresponding path program 1 times [2019-10-02 13:38:09,278 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:38:09,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:38:09,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:09,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:38:09,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:38:09,580 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:38:09,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:38:09,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:38:09,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:38:09,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:38:09,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:38:09,588 INFO L87 Difference]: Start difference. First operand 427 states and 570 transitions. Second operand 3 states. [2019-10-02 13:38:09,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:38:09,653 INFO L93 Difference]: Finished difference Result 625 states and 820 transitions. [2019-10-02 13:38:09,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:38:09,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-10-02 13:38:09,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:38:09,659 INFO L225 Difference]: With dead ends: 625 [2019-10-02 13:38:09,660 INFO L226 Difference]: Without dead ends: 430 [2019-10-02 13:38:09,667 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:38:09,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-10-02 13:38:09,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 429. [2019-10-02 13:38:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-10-02 13:38:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 572 transitions. [2019-10-02 13:38:09,710 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 572 transitions. Word has length 177 [2019-10-02 13:38:09,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:38:09,712 INFO L475 AbstractCegarLoop]: Abstraction has 429 states and 572 transitions. [2019-10-02 13:38:09,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:38:09,712 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 572 transitions. [2019-10-02 13:38:09,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 13:38:09,717 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:38:09,717 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:38:09,717 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:38:09,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:38:09,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2130216492, now seen corresponding path program 1 times [2019-10-02 13:38:09,718 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:38:09,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:38:09,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:09,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:38:09,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:38:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:38:09,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:38:09,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:38:09,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:38:09,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:38:09,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:38:09,994 INFO L87 Difference]: Start difference. First operand 429 states and 572 transitions. Second operand 3 states. [2019-10-02 13:38:10,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:38:10,023 INFO L93 Difference]: Finished difference Result 834 states and 1142 transitions. [2019-10-02 13:38:10,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:38:10,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-10-02 13:38:10,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:38:10,028 INFO L225 Difference]: With dead ends: 834 [2019-10-02 13:38:10,028 INFO L226 Difference]: Without dead ends: 470 [2019-10-02 13:38:10,029 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:38:10,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-10-02 13:38:10,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 469. [2019-10-02 13:38:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-10-02 13:38:10,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 641 transitions. [2019-10-02 13:38:10,050 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 641 transitions. Word has length 187 [2019-10-02 13:38:10,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:38:10,050 INFO L475 AbstractCegarLoop]: Abstraction has 469 states and 641 transitions. [2019-10-02 13:38:10,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:38:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 641 transitions. [2019-10-02 13:38:10,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-02 13:38:10,054 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:38:10,055 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:38:10,055 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:38:10,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:38:10,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1179138555, now seen corresponding path program 1 times [2019-10-02 13:38:10,055 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:38:10,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:38:10,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:10,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:38:10,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:38:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:38:10,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:38:10,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:38:10,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:38:10,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:38:10,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:38:10,206 INFO L87 Difference]: Start difference. First operand 469 states and 641 transitions. Second operand 3 states. [2019-10-02 13:38:10,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:38:10,250 INFO L93 Difference]: Finished difference Result 951 states and 1344 transitions. [2019-10-02 13:38:10,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:38:10,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-10-02 13:38:10,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:38:10,261 INFO L225 Difference]: With dead ends: 951 [2019-10-02 13:38:10,261 INFO L226 Difference]: Without dead ends: 547 [2019-10-02 13:38:10,264 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:38:10,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-10-02 13:38:10,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 546. [2019-10-02 13:38:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-10-02 13:38:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 773 transitions. [2019-10-02 13:38:10,304 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 773 transitions. Word has length 188 [2019-10-02 13:38:10,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:38:10,305 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 773 transitions. [2019-10-02 13:38:10,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:38:10,306 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 773 transitions. [2019-10-02 13:38:10,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 13:38:10,312 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:38:10,312 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:38:10,313 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:38:10,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:38:10,313 INFO L82 PathProgramCache]: Analyzing trace with hash -2052303444, now seen corresponding path program 1 times [2019-10-02 13:38:10,313 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:38:10,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:38:10,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:10,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:38:10,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:38:10,598 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:38:10,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:38:10,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:38:10,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:38:10,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:38:10,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:38:10,602 INFO L87 Difference]: Start difference. First operand 546 states and 773 transitions. Second operand 3 states. [2019-10-02 13:38:10,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:38:10,655 INFO L93 Difference]: Finished difference Result 1176 states and 1730 transitions. [2019-10-02 13:38:10,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:38:10,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-10-02 13:38:10,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:38:10,663 INFO L225 Difference]: With dead ends: 1176 [2019-10-02 13:38:10,663 INFO L226 Difference]: Without dead ends: 695 [2019-10-02 13:38:10,666 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:38:10,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-10-02 13:38:10,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 694. [2019-10-02 13:38:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-10-02 13:38:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1025 transitions. [2019-10-02 13:38:10,728 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1025 transitions. Word has length 189 [2019-10-02 13:38:10,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:38:10,730 INFO L475 AbstractCegarLoop]: Abstraction has 694 states and 1025 transitions. [2019-10-02 13:38:10,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:38:10,730 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1025 transitions. [2019-10-02 13:38:10,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 13:38:10,739 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:38:10,740 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:38:10,740 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:38:10,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:38:10,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1144858235, now seen corresponding path program 1 times [2019-10-02 13:38:10,741 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:38:10,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:38:10,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:10,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:38:10,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:38:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:38:11,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:38:11,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:38:11,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:38:11,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:38:11,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:38:11,009 INFO L87 Difference]: Start difference. First operand 694 states and 1025 transitions. Second operand 3 states. [2019-10-02 13:38:11,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:38:11,066 INFO L93 Difference]: Finished difference Result 1608 states and 2466 transitions. [2019-10-02 13:38:11,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:38:11,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-10-02 13:38:11,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:38:11,074 INFO L225 Difference]: With dead ends: 1608 [2019-10-02 13:38:11,074 INFO L226 Difference]: Without dead ends: 979 [2019-10-02 13:38:11,077 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:38:11,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2019-10-02 13:38:11,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 978. [2019-10-02 13:38:11,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2019-10-02 13:38:11,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1505 transitions. [2019-10-02 13:38:11,118 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1505 transitions. Word has length 190 [2019-10-02 13:38:11,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:38:11,119 INFO L475 AbstractCegarLoop]: Abstraction has 978 states and 1505 transitions. [2019-10-02 13:38:11,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:38:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1505 transitions. [2019-10-02 13:38:11,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 13:38:11,125 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:38:11,126 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:38:11,126 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:38:11,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:38:11,126 INFO L82 PathProgramCache]: Analyzing trace with hash -862158447, now seen corresponding path program 1 times [2019-10-02 13:38:11,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:38:11,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:38:11,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:11,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:38:11,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:38:11,418 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 13:38:11,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:38:11,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 13:38:11,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:38:11,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:38:11,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:38:11,421 INFO L87 Difference]: Start difference. First operand 978 states and 1505 transitions. Second operand 11 states. [2019-10-02 13:38:15,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:38:15,384 INFO L93 Difference]: Finished difference Result 2434 states and 3435 transitions. [2019-10-02 13:38:15,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 13:38:15,384 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 193 [2019-10-02 13:38:15,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:38:15,398 INFO L225 Difference]: With dead ends: 2434 [2019-10-02 13:38:15,399 INFO L226 Difference]: Without dead ends: 2059 [2019-10-02 13:38:15,401 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-10-02 13:38:15,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2019-10-02 13:38:15,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 2044. [2019-10-02 13:38:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2019-10-02 13:38:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2886 transitions. [2019-10-02 13:38:15,490 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2886 transitions. Word has length 193 [2019-10-02 13:38:15,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:38:15,490 INFO L475 AbstractCegarLoop]: Abstraction has 2044 states and 2886 transitions. [2019-10-02 13:38:15,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:38:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2886 transitions. [2019-10-02 13:38:15,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 13:38:15,497 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:38:15,498 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:38:15,498 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:38:15,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:38:15,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1182728700, now seen corresponding path program 1 times [2019-10-02 13:38:15,499 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:38:15,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:38:15,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:15,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:38:15,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:38:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 13:38:15,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:38:15,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-02 13:38:15,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 13:38:15,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 13:38:15,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:38:15,784 INFO L87 Difference]: Start difference. First operand 2044 states and 2886 transitions. Second operand 16 states. [2019-10-02 13:38:16,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:38:16,293 INFO L93 Difference]: Finished difference Result 3086 states and 4232 transitions. [2019-10-02 13:38:16,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:38:16,293 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 194 [2019-10-02 13:38:16,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:38:16,304 INFO L225 Difference]: With dead ends: 3086 [2019-10-02 13:38:16,304 INFO L226 Difference]: Without dead ends: 1774 [2019-10-02 13:38:16,308 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:38:16,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2019-10-02 13:38:16,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1695. [2019-10-02 13:38:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1695 states. [2019-10-02 13:38:16,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2422 transitions. [2019-10-02 13:38:16,382 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2422 transitions. Word has length 194 [2019-10-02 13:38:16,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:38:16,382 INFO L475 AbstractCegarLoop]: Abstraction has 1695 states and 2422 transitions. [2019-10-02 13:38:16,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 13:38:16,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2422 transitions. [2019-10-02 13:38:16,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-02 13:38:16,389 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:38:16,389 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:38:16,390 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:38:16,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:38:16,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2089057104, now seen corresponding path program 1 times [2019-10-02 13:38:16,390 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:38:16,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:38:16,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:16,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:38:16,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:38:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 13:38:16,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:38:16,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:38:16,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:38:16,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:38:16,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:38:16,562 INFO L87 Difference]: Start difference. First operand 1695 states and 2422 transitions. Second operand 6 states. [2019-10-02 13:38:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:38:17,128 INFO L93 Difference]: Finished difference Result 4252 states and 6012 transitions. [2019-10-02 13:38:17,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:38:17,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2019-10-02 13:38:17,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:38:17,157 INFO L225 Difference]: With dead ends: 4252 [2019-10-02 13:38:17,157 INFO L226 Difference]: Without dead ends: 3381 [2019-10-02 13:38:17,164 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:38:17,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2019-10-02 13:38:17,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 3310. [2019-10-02 13:38:17,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3310 states. [2019-10-02 13:38:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 3310 states and 4816 transitions. [2019-10-02 13:38:17,387 INFO L78 Accepts]: Start accepts. Automaton has 3310 states and 4816 transitions. Word has length 203 [2019-10-02 13:38:17,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:38:17,388 INFO L475 AbstractCegarLoop]: Abstraction has 3310 states and 4816 transitions. [2019-10-02 13:38:17,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:38:17,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3310 states and 4816 transitions. [2019-10-02 13:38:17,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-02 13:38:17,430 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:38:17,430 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:38:17,430 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:38:17,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:38:17,431 INFO L82 PathProgramCache]: Analyzing trace with hash -80625117, now seen corresponding path program 1 times [2019-10-02 13:38:17,431 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:38:17,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:38:17,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:17,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:38:17,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:38:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 13:38:17,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:38:17,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:38:17,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:38:17,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:38:17,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:38:17,582 INFO L87 Difference]: Start difference. First operand 3310 states and 4816 transitions. Second operand 5 states. [2019-10-02 13:38:18,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:38:18,700 INFO L93 Difference]: Finished difference Result 10095 states and 14251 transitions. [2019-10-02 13:38:18,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 13:38:18,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-10-02 13:38:18,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:38:18,754 INFO L225 Difference]: With dead ends: 10095 [2019-10-02 13:38:18,754 INFO L226 Difference]: Without dead ends: 8364 [2019-10-02 13:38:18,766 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:38:18,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8364 states. [2019-10-02 13:38:19,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8364 to 8228. [2019-10-02 13:38:19,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8228 states. [2019-10-02 13:38:19,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8228 states to 8228 states and 11880 transitions. [2019-10-02 13:38:19,254 INFO L78 Accepts]: Start accepts. Automaton has 8228 states and 11880 transitions. Word has length 204 [2019-10-02 13:38:19,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:38:19,254 INFO L475 AbstractCegarLoop]: Abstraction has 8228 states and 11880 transitions. [2019-10-02 13:38:19,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:38:19,255 INFO L276 IsEmpty]: Start isEmpty. Operand 8228 states and 11880 transitions. [2019-10-02 13:38:19,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-02 13:38:19,278 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:38:19,278 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:38:19,278 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:38:19,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:38:19,279 INFO L82 PathProgramCache]: Analyzing trace with hash -667401236, now seen corresponding path program 1 times [2019-10-02 13:38:19,279 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:38:19,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:38:19,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:19,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:38:19,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:38:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 13:38:19,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:38:19,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 13:38:19,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:38:19,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:38:19,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:38:19,496 INFO L87 Difference]: Start difference. First operand 8228 states and 11880 transitions. Second operand 9 states. [2019-10-02 13:38:19,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:38:19,976 INFO L93 Difference]: Finished difference Result 12193 states and 16859 transitions. [2019-10-02 13:38:19,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 13:38:19,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 204 [2019-10-02 13:38:19,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:38:20,043 INFO L225 Difference]: With dead ends: 12193 [2019-10-02 13:38:20,043 INFO L226 Difference]: Without dead ends: 7324 [2019-10-02 13:38:20,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-10-02 13:38:20,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7324 states. [2019-10-02 13:38:20,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7324 to 7143. [2019-10-02 13:38:20,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7143 states. [2019-10-02 13:38:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7143 states to 7143 states and 10470 transitions. [2019-10-02 13:38:20,522 INFO L78 Accepts]: Start accepts. Automaton has 7143 states and 10470 transitions. Word has length 204 [2019-10-02 13:38:20,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:38:20,523 INFO L475 AbstractCegarLoop]: Abstraction has 7143 states and 10470 transitions. [2019-10-02 13:38:20,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:38:20,524 INFO L276 IsEmpty]: Start isEmpty. Operand 7143 states and 10470 transitions. [2019-10-02 13:38:20,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-02 13:38:20,547 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:38:20,547 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:38:20,548 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:38:20,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:38:20,548 INFO L82 PathProgramCache]: Analyzing trace with hash -341043388, now seen corresponding path program 1 times [2019-10-02 13:38:20,548 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:38:20,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:38:20,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:20,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:38:20,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:38:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:38:20,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:38:20,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:38:20,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:38:20,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:38:20,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:38:20,787 INFO L87 Difference]: Start difference. First operand 7143 states and 10470 transitions. Second operand 8 states. [2019-10-02 13:38:24,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:38:24,387 INFO L93 Difference]: Finished difference Result 21795 states and 34408 transitions. [2019-10-02 13:38:24,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:38:24,388 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 241 [2019-10-02 13:38:24,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:38:24,480 INFO L225 Difference]: With dead ends: 21795 [2019-10-02 13:38:24,480 INFO L226 Difference]: Without dead ends: 14717 [2019-10-02 13:38:24,512 INFO L640 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-10-02 13:38:24,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14717 states. [2019-10-02 13:38:25,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14717 to 10431. [2019-10-02 13:38:25,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10431 states. [2019-10-02 13:38:25,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10431 states to 10431 states and 17390 transitions. [2019-10-02 13:38:25,861 INFO L78 Accepts]: Start accepts. Automaton has 10431 states and 17390 transitions. Word has length 241 [2019-10-02 13:38:25,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:38:25,862 INFO L475 AbstractCegarLoop]: Abstraction has 10431 states and 17390 transitions. [2019-10-02 13:38:25,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:38:25,862 INFO L276 IsEmpty]: Start isEmpty. Operand 10431 states and 17390 transitions. [2019-10-02 13:38:25,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-02 13:38:25,917 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:38:25,918 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:38:25,918 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:38:25,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:38:25,919 INFO L82 PathProgramCache]: Analyzing trace with hash -790262356, now seen corresponding path program 1 times [2019-10-02 13:38:25,919 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:38:25,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:38:25,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:25,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:38:25,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:38:26,131 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:38:26,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:38:26,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:38:26,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:38:26,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:38:26,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:38:26,134 INFO L87 Difference]: Start difference. First operand 10431 states and 17390 transitions. Second operand 8 states. [2019-10-02 13:38:29,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:38:29,822 INFO L93 Difference]: Finished difference Result 32195 states and 58424 transitions. [2019-10-02 13:38:29,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:38:29,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2019-10-02 13:38:29,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:38:29,954 INFO L225 Difference]: With dead ends: 32195 [2019-10-02 13:38:29,954 INFO L226 Difference]: Without dead ends: 21829 [2019-10-02 13:38:30,034 INFO L640 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-10-02 13:38:30,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21829 states. [2019-10-02 13:38:31,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21829 to 17127. [2019-10-02 13:38:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17127 states. [2019-10-02 13:38:31,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17127 states to 17127 states and 32574 transitions. [2019-10-02 13:38:31,362 INFO L78 Accepts]: Start accepts. Automaton has 17127 states and 32574 transitions. Word has length 227 [2019-10-02 13:38:31,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:38:31,363 INFO L475 AbstractCegarLoop]: Abstraction has 17127 states and 32574 transitions. [2019-10-02 13:38:31,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:38:31,363 INFO L276 IsEmpty]: Start isEmpty. Operand 17127 states and 32574 transitions. [2019-10-02 13:38:31,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 13:38:31,466 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:38:31,467 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:38:31,467 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:38:31,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:38:31,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1621648930, now seen corresponding path program 1 times [2019-10-02 13:38:31,468 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:38:31,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:38:31,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:31,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:38:31,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:38:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:38:31,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:38:31,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:38:31,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:38:31,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:38:31,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:38:31,646 INFO L87 Difference]: Start difference. First operand 17127 states and 32574 transitions. Second operand 8 states. [2019-10-02 13:38:36,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:38:36,385 INFO L93 Difference]: Finished difference Result 53267 states and 110444 transitions. [2019-10-02 13:38:36,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:38:36,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 228 [2019-10-02 13:38:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:38:36,634 INFO L225 Difference]: With dead ends: 53267 [2019-10-02 13:38:36,634 INFO L226 Difference]: Without dead ends: 36205 [2019-10-02 13:38:36,712 INFO L640 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-10-02 13:38:36,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36205 states. [2019-10-02 13:38:38,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36205 to 30647. [2019-10-02 13:38:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30647 states. [2019-10-02 13:38:38,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30647 states to 30647 states and 65490 transitions. [2019-10-02 13:38:38,771 INFO L78 Accepts]: Start accepts. Automaton has 30647 states and 65490 transitions. Word has length 228 [2019-10-02 13:38:38,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:38:38,771 INFO L475 AbstractCegarLoop]: Abstraction has 30647 states and 65490 transitions. [2019-10-02 13:38:38,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:38:38,771 INFO L276 IsEmpty]: Start isEmpty. Operand 30647 states and 65490 transitions. [2019-10-02 13:38:38,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-02 13:38:38,938 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:38:38,938 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:38:38,938 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:38:38,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:38:38,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1766914587, now seen corresponding path program 1 times [2019-10-02 13:38:38,939 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:38:38,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:38:38,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:38,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:38:38,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:38:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 13:38:39,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:38:39,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 13:38:39,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:38:39,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:38:39,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:38:39,138 INFO L87 Difference]: Start difference. First operand 30647 states and 65490 transitions. Second operand 11 states. [2019-10-02 13:38:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:38:41,461 INFO L93 Difference]: Finished difference Result 36295 states and 72743 transitions. [2019-10-02 13:38:41,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:38:41,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 232 [2019-10-02 13:38:41,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:38:41,641 INFO L225 Difference]: With dead ends: 36295 [2019-10-02 13:38:41,641 INFO L226 Difference]: Without dead ends: 34395 [2019-10-02 13:38:41,667 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-10-02 13:38:41,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34395 states. [2019-10-02 13:38:43,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34395 to 34171. [2019-10-02 13:38:43,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34171 states. [2019-10-02 13:38:43,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34171 states to 34171 states and 70093 transitions. [2019-10-02 13:38:43,625 INFO L78 Accepts]: Start accepts. Automaton has 34171 states and 70093 transitions. Word has length 232 [2019-10-02 13:38:43,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:38:43,627 INFO L475 AbstractCegarLoop]: Abstraction has 34171 states and 70093 transitions. [2019-10-02 13:38:43,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:38:43,627 INFO L276 IsEmpty]: Start isEmpty. Operand 34171 states and 70093 transitions. [2019-10-02 13:38:43,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-02 13:38:43,732 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:38:43,732 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:38:43,733 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:38:43,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:38:43,733 INFO L82 PathProgramCache]: Analyzing trace with hash -150698441, now seen corresponding path program 1 times [2019-10-02 13:38:43,733 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:38:43,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:38:43,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:43,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:38:43,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:38:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:38:45,350 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 13:38:45,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:38:45,351 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:38:45,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:38:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:38:46,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 2900 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:38:46,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:38:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 13:38:46,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:38:46,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [53] total 59 [2019-10-02 13:38:46,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-02 13:38:46,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-02 13:38:46,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=3278, Unknown=0, NotChecked=0, Total=3422 [2019-10-02 13:38:46,979 INFO L87 Difference]: Start difference. First operand 34171 states and 70093 transitions. Second operand 59 states. [2019-10-02 13:39:01,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:39:01,399 INFO L93 Difference]: Finished difference Result 105113 states and 220699 transitions. [2019-10-02 13:39:01,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-02 13:39:01,399 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 248 [2019-10-02 13:39:01,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:39:01,947 INFO L225 Difference]: With dead ends: 105113 [2019-10-02 13:39:01,948 INFO L226 Difference]: Without dead ends: 70845 [2019-10-02 13:39:02,255 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3302 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1058, Invalid=15972, Unknown=0, NotChecked=0, Total=17030 [2019-10-02 13:39:02,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70845 states. [2019-10-02 13:39:10,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70845 to 69865. [2019-10-02 13:39:10,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69865 states. [2019-10-02 13:39:10,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69865 states to 69865 states and 142390 transitions. [2019-10-02 13:39:10,942 INFO L78 Accepts]: Start accepts. Automaton has 69865 states and 142390 transitions. Word has length 248 [2019-10-02 13:39:10,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:39:10,942 INFO L475 AbstractCegarLoop]: Abstraction has 69865 states and 142390 transitions. [2019-10-02 13:39:10,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-02 13:39:10,942 INFO L276 IsEmpty]: Start isEmpty. Operand 69865 states and 142390 transitions. [2019-10-02 13:39:11,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-10-02 13:39:11,197 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:39:11,197 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:39:11,198 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:39:11,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:39:11,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1587142377, now seen corresponding path program 1 times [2019-10-02 13:39:11,198 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:39:11,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:39:11,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:39:11,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:39:11,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:39:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:39:13,072 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 13:39:13,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:39:13,073 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:39:13,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:39:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:39:13,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 2910 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:39:13,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:39:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 13:39:13,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:39:13,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [50] total 54 [2019-10-02 13:39:13,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-02 13:39:13,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-02 13:39:13,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=2743, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 13:39:13,852 INFO L87 Difference]: Start difference. First operand 69865 states and 142390 transitions. Second operand 54 states. [2019-10-02 13:39:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:39:44,696 INFO L93 Difference]: Finished difference Result 302704 states and 603791 transitions. [2019-10-02 13:39:44,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-10-02 13:39:44,697 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 253 [2019-10-02 13:39:44,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:39:46,012 INFO L225 Difference]: With dead ends: 302704 [2019-10-02 13:39:46,012 INFO L226 Difference]: Without dead ends: 232925 [2019-10-02 13:39:46,293 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8108 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2005, Invalid=29857, Unknown=0, NotChecked=0, Total=31862 [2019-10-02 13:39:46,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232925 states. [2019-10-02 13:40:02,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232925 to 227673. [2019-10-02 13:40:02,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227673 states. [2019-10-02 13:40:03,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227673 states to 227673 states and 450105 transitions. [2019-10-02 13:40:03,854 INFO L78 Accepts]: Start accepts. Automaton has 227673 states and 450105 transitions. Word has length 253 [2019-10-02 13:40:03,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:40:03,855 INFO L475 AbstractCegarLoop]: Abstraction has 227673 states and 450105 transitions. [2019-10-02 13:40:03,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-02 13:40:03,855 INFO L276 IsEmpty]: Start isEmpty. Operand 227673 states and 450105 transitions. [2019-10-02 13:40:10,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-10-02 13:40:10,414 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:40:10,414 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:40:10,414 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:40:10,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:40:10,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1293848366, now seen corresponding path program 1 times [2019-10-02 13:40:10,415 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:40:10,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:40:10,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:40:10,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:40:10,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:40:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:40:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:40:12,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:40:12,106 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:40:12,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:40:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:40:12,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 2910 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:40:12,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:40:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 13:40:13,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:40:13,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [45] total 52 [2019-10-02 13:40:13,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-02 13:40:13,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-02 13:40:13,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=2534, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 13:40:13,029 INFO L87 Difference]: Start difference. First operand 227673 states and 450105 transitions. Second operand 52 states. [2019-10-02 13:40:35,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:40:35,018 INFO L93 Difference]: Finished difference Result 459109 states and 958196 transitions. [2019-10-02 13:40:35,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-02 13:40:35,018 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 253 [2019-10-02 13:40:35,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:40:36,048 INFO L225 Difference]: With dead ends: 459109 [2019-10-02 13:40:36,049 INFO L226 Difference]: Without dead ends: 230616 [2019-10-02 13:40:37,413 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=720, Invalid=8592, Unknown=0, NotChecked=0, Total=9312 [2019-10-02 13:40:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230616 states. [2019-10-02 13:40:55,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230616 to 222402. [2019-10-02 13:40:55,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222402 states. [2019-10-02 13:40:56,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222402 states to 222402 states and 401047 transitions. [2019-10-02 13:40:56,719 INFO L78 Accepts]: Start accepts. Automaton has 222402 states and 401047 transitions. Word has length 253 [2019-10-02 13:40:56,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:40:56,720 INFO L475 AbstractCegarLoop]: Abstraction has 222402 states and 401047 transitions. [2019-10-02 13:40:56,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-02 13:40:56,720 INFO L276 IsEmpty]: Start isEmpty. Operand 222402 states and 401047 transitions. [2019-10-02 13:40:57,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-02 13:40:57,363 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:40:57,363 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:40:57,363 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:40:57,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:40:57,364 INFO L82 PathProgramCache]: Analyzing trace with hash 2138629978, now seen corresponding path program 1 times [2019-10-02 13:40:57,364 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:40:57,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:40:57,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:40:57,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:40:57,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:40:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:40:57,526 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:40:57,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:40:57,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:40:57,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:40:57,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:40:57,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:40:57,529 INFO L87 Difference]: Start difference. First operand 222402 states and 401047 transitions. Second operand 7 states. [2019-10-02 13:41:21,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:41:21,016 INFO L93 Difference]: Finished difference Result 514545 states and 910274 transitions. [2019-10-02 13:41:21,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:41:21,017 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 242 [2019-10-02 13:41:21,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:41:23,413 INFO L225 Difference]: With dead ends: 514545 [2019-10-02 13:41:23,413 INFO L226 Difference]: Without dead ends: 425555 [2019-10-02 13:41:23,641 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:41:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425555 states. [2019-10-02 13:41:55,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425555 to 418047. [2019-10-02 13:41:55,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418047 states. [2019-10-02 13:42:05,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418047 states to 418047 states and 781787 transitions. [2019-10-02 13:42:06,030 INFO L78 Accepts]: Start accepts. Automaton has 418047 states and 781787 transitions. Word has length 242 [2019-10-02 13:42:06,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:42:06,031 INFO L475 AbstractCegarLoop]: Abstraction has 418047 states and 781787 transitions. [2019-10-02 13:42:06,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:42:06,031 INFO L276 IsEmpty]: Start isEmpty. Operand 418047 states and 781787 transitions. [2019-10-02 13:42:09,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-10-02 13:42:09,220 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:42:09,221 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-10-02 13:42:09,221 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:42:09,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:42:09,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1895447695, now seen corresponding path program 1 times [2019-10-02 13:42:09,222 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:42:09,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:42:09,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:09,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:42:09,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:42:09,951 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 13:42:09,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:42:09,952 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:42:10,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:42:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:42:11,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 3011 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:42:11,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:42:11,491 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:42:11,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:42:11,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [34] total 41 [2019-10-02 13:42:11,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-02 13:42:11,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-02 13:42:11,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1547, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 13:42:11,501 INFO L87 Difference]: Start difference. First operand 418047 states and 781787 transitions. Second operand 41 states. [2019-10-02 13:43:05,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:43:05,445 INFO L93 Difference]: Finished difference Result 955596 states and 1742623 transitions. [2019-10-02 13:43:05,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-10-02 13:43:05,446 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 281 [2019-10-02 13:43:05,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:43:07,556 INFO L225 Difference]: With dead ends: 955596 [2019-10-02 13:43:07,556 INFO L226 Difference]: Without dead ends: 531110 [2019-10-02 13:43:09,325 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2509 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1202, Invalid=11230, Unknown=0, NotChecked=0, Total=12432 [2019-10-02 13:43:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531110 states. [2019-10-02 13:43:52,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531110 to 500431. [2019-10-02 13:43:52,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500431 states. [2019-10-02 13:44:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500431 states to 500431 states and 904497 transitions. [2019-10-02 13:44:08,447 INFO L78 Accepts]: Start accepts. Automaton has 500431 states and 904497 transitions. Word has length 281 [2019-10-02 13:44:08,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:44:08,447 INFO L475 AbstractCegarLoop]: Abstraction has 500431 states and 904497 transitions. [2019-10-02 13:44:08,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-02 13:44:08,448 INFO L276 IsEmpty]: Start isEmpty. Operand 500431 states and 904497 transitions. [2019-10-02 13:44:12,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-02 13:44:12,006 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:44:12,006 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:44:12,007 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:44:12,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:44:12,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1970000604, now seen corresponding path program 1 times [2019-10-02 13:44:12,007 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:44:12,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:44:12,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:44:12,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:44:12,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:44:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:44:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 13:44:12,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:44:12,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:44:12,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:44:12,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:44:12,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:44:12,176 INFO L87 Difference]: Start difference. First operand 500431 states and 904497 transitions. Second operand 6 states. [2019-10-02 13:44:43,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:44:43,022 INFO L93 Difference]: Finished difference Result 1000802 states and 1831956 transitions. [2019-10-02 13:44:43,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 13:44:43,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 284 [2019-10-02 13:44:43,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:44:45,087 INFO L225 Difference]: With dead ends: 1000802 [2019-10-02 13:44:45,088 INFO L226 Difference]: Without dead ends: 500063 [2019-10-02 13:44:47,453 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:44:47,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500063 states. [2019-10-02 13:45:47,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500063 to 493233. [2019-10-02 13:45:47,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493233 states. [2019-10-02 13:45:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493233 states to 493233 states and 893835 transitions. [2019-10-02 13:45:50,655 INFO L78 Accepts]: Start accepts. Automaton has 493233 states and 893835 transitions. Word has length 284 [2019-10-02 13:45:50,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:45:50,656 INFO L475 AbstractCegarLoop]: Abstraction has 493233 states and 893835 transitions. [2019-10-02 13:45:50,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:45:50,656 INFO L276 IsEmpty]: Start isEmpty. Operand 493233 states and 893835 transitions. [2019-10-02 13:46:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-10-02 13:46:06,943 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:46:06,943 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:46:06,943 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:46:06,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:46:06,944 INFO L82 PathProgramCache]: Analyzing trace with hash 179958977, now seen corresponding path program 1 times [2019-10-02 13:46:06,944 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:46:06,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:46:06,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:46:06,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:46:06,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:46:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:46:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:46:07,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:46:07,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 13:46:07,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:46:07,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:46:07,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:46:07,220 INFO L87 Difference]: Start difference. First operand 493233 states and 893835 transitions. Second operand 13 states. [2019-10-02 13:47:01,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:47:01,634 INFO L93 Difference]: Finished difference Result 1100630 states and 1955059 transitions. [2019-10-02 13:47:01,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 13:47:01,635 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 266 [2019-10-02 13:47:01,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:47:06,388 INFO L225 Difference]: With dead ends: 1100630 [2019-10-02 13:47:06,389 INFO L226 Difference]: Without dead ends: 995113 [2019-10-02 13:47:06,845 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2019-10-02 13:47:08,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995113 states.