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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec6_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:42:09,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:42:09,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:42:09,060 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:42:09,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:42:09,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:42:09,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:42:09,065 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:42:09,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:42:09,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:42:09,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:42:09,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:42:09,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:42:09,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:42:09,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:42:09,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:42:09,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:42:09,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:42:09,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:42:09,078 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:42:09,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:42:09,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:42:09,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:42:09,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:42:09,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:42:09,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:42:09,086 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:42:09,087 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:42:09,087 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:42:09,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:42:09,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:42:09,090 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:42:09,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:42:09,091 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:42:09,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:42:09,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:42:09,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:42:09,093 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:42:09,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:42:09,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:42:09,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:42:09,096 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:42:09,111 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:42:09,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:42:09,111 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:42:09,112 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:42:09,112 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:42:09,112 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:42:09,113 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:42:09,113 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:42:09,113 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:42:09,113 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:42:09,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:42:09,114 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:42:09,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:42:09,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:42:09,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:42:09,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:42:09,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:42:09,116 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:42:09,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:42:09,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:42:09,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:42:09,116 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:42:09,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:42:09,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:42:09,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:42:09,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:42:09,117 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:42:09,118 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:42:09,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:42:09,118 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:42:09,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:42:09,157 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:42:09,161 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:42:09,162 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:42:09,163 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:42:09,163 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec6_product30.cil.c [2019-09-10 02:42:09,225 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7b9e1a0c/54c4b1c864a848e5823a51836d7056ad/FLAG2ee755a96 [2019-09-10 02:42:09,874 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:42:09,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec6_product30.cil.c [2019-09-10 02:42:09,902 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7b9e1a0c/54c4b1c864a848e5823a51836d7056ad/FLAG2ee755a96 [2019-09-10 02:42:10,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7b9e1a0c/54c4b1c864a848e5823a51836d7056ad [2019-09-10 02:42:10,094 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:42:10,096 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:42:10,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:42:10,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:42:10,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:42:10,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:42:10" (1/1) ... [2019-09-10 02:42:10,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d0047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:42:10, skipping insertion in model container [2019-09-10 02:42:10,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:42:10" (1/1) ... [2019-09-10 02:42:10,113 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:42:10,199 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:42:11,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:42:11,048 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:42:11,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:42:11,258 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:42:11,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:42:11 WrapperNode [2019-09-10 02:42:11,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:42:11,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:42:11,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:42:11,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:42:11,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:42:11" (1/1) ... [2019-09-10 02:42:11,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:42:11" (1/1) ... [2019-09-10 02:42:11,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:42:11" (1/1) ... [2019-09-10 02:42:11,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:42:11" (1/1) ... [2019-09-10 02:42:11,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:42:11" (1/1) ... [2019-09-10 02:42:11,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:42:11" (1/1) ... [2019-09-10 02:42:11,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:42:11" (1/1) ... [2019-09-10 02:42:11,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:42:11,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:42:11,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:42:11,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:42:11,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:42:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:42:11,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:42:11,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:42:11,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:42:11,565 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:42:11,565 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:42:11,565 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:42:11,565 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:42:11,566 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:42:11,566 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-10 02:42:11,566 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-10 02:42:11,567 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-10 02:42:11,567 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-10 02:42:11,567 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-10 02:42:11,568 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-10 02:42:11,569 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-10 02:42:11,570 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-10 02:42:11,570 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-10 02:42:11,570 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-10 02:42:11,570 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-10 02:42:11,570 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-10 02:42:11,571 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-10 02:42:11,571 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-10 02:42:11,571 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-10 02:42:11,571 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-10 02:42:11,572 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-10 02:42:11,572 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-10 02:42:11,573 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-10 02:42:11,573 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-10 02:42:11,573 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-10 02:42:11,573 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-10 02:42:11,573 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-10 02:42:11,574 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-10 02:42:11,574 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-10 02:42:11,574 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-10 02:42:11,574 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-10 02:42:11,574 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-10 02:42:11,574 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-10 02:42:11,574 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-10 02:42:11,575 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-10 02:42:11,575 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-10 02:42:11,576 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-10 02:42:11,576 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-10 02:42:11,576 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-10 02:42:11,576 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-10 02:42:11,576 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-10 02:42:11,577 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-10 02:42:11,577 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-10 02:42:11,577 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-10 02:42:11,577 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-10 02:42:11,577 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-10 02:42:11,577 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-10 02:42:11,577 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-10 02:42:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-10 02:42:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-10 02:42:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-10 02:42:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-10 02:42:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-10 02:42:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-10 02:42:11,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-10 02:42:11,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-10 02:42:11,579 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-10 02:42:11,579 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-10 02:42:11,579 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-10 02:42:11,579 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-10 02:42:11,580 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-10 02:42:11,580 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-10 02:42:11,580 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-10 02:42:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-10 02:42:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-10 02:42:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-10 02:42:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-10 02:42:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-10 02:42:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-10 02:42:11,582 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-10 02:42:11,582 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-10 02:42:11,583 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-10 02:42:11,583 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-10 02:42:11,583 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-10 02:42:11,583 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-10 02:42:11,584 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-10 02:42:11,584 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-10 02:42:11,584 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-10 02:42:11,584 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AutoResponder [2019-09-10 02:42:11,585 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-09-10 02:42:11,585 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-10 02:42:11,586 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-10 02:42:11,586 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-10 02:42:11,586 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-10 02:42:11,587 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-10 02:42:11,587 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:42:11,587 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:42:11,587 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:42:11,587 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:42:11,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:42:11,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:42:11,588 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-10 02:42:11,588 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-10 02:42:11,588 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-10 02:42:11,589 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-10 02:42:11,589 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-10 02:42:11,589 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-10 02:42:11,589 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-10 02:42:11,589 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-10 02:42:11,589 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:42:11,589 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:42:11,590 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-10 02:42:11,590 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-10 02:42:11,590 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-10 02:42:11,590 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-10 02:42:11,590 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-10 02:42:11,590 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-10 02:42:11,590 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-10 02:42:11,591 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-10 02:42:11,591 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-10 02:42:11,591 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-10 02:42:11,592 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:42:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:42:11,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:42:11,593 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-10 02:42:11,593 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-10 02:42:11,593 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-10 02:42:11,593 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-10 02:42:11,594 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-10 02:42:11,595 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-10 02:42:11,595 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-10 02:42:11,595 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-10 02:42:11,595 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-10 02:42:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:42:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:42:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:42:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:42:11,597 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:42:11,597 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-10 02:42:11,597 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-10 02:42:11,597 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-10 02:42:11,597 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-10 02:42:11,597 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-10 02:42:11,598 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-10 02:42:11,598 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-10 02:42:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-10 02:42:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-10 02:42:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-10 02:42:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-10 02:42:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-10 02:42:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-10 02:42:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-10 02:42:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-10 02:42:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-10 02:42:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-10 02:42:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-10 02:42:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-10 02:42:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-10 02:42:11,611 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-10 02:42:11,611 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-10 02:42:11,611 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-10 02:42:11,611 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-10 02:42:11,613 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-10 02:42:11,613 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-10 02:42:11,613 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-10 02:42:11,613 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-10 02:42:11,613 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-10 02:42:11,614 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-10 02:42:11,614 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-10 02:42:11,614 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-10 02:42:11,614 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-10 02:42:11,614 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-10 02:42:11,614 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-10 02:42:11,615 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-10 02:42:11,615 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-10 02:42:11,615 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-10 02:42:11,615 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-10 02:42:11,615 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-10 02:42:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-10 02:42:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-10 02:42:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-10 02:42:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-10 02:42:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-10 02:42:11,617 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-10 02:42:11,617 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-10 02:42:11,617 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-10 02:42:11,617 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-10 02:42:11,617 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-10 02:42:11,617 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:42:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-10 02:42:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:42:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-10 02:42:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-10 02:42:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:42:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-10 02:42:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-10 02:42:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-10 02:42:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-10 02:42:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-10 02:42:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-10 02:42:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-10 02:42:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-10 02:42:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-10 02:42:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-10 02:42:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-10 02:42:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-10 02:42:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-10 02:42:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-10 02:42:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-10 02:42:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-10 02:42:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-10 02:42:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-10 02:42:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-10 02:42:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-10 02:42:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-10 02:42:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-10 02:42:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-10 02:42:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-10 02:42:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-10 02:42:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-10 02:42:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AutoResponder [2019-09-10 02:42:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-09-10 02:42:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-10 02:42:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:42:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:42:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:42:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:42:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:42:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:42:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:42:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:42:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:42:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:42:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:42:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:42:11,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:42:11,626 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:42:11,626 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:42:11,626 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:42:11,626 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-10 02:42:11,626 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-10 02:42:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-10 02:42:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-10 02:42:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:42:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:42:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-10 02:42:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-10 02:42:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-10 02:42:11,628 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-10 02:42:11,628 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-10 02:42:11,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:42:11,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:42:11,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:42:13,988 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:42:13,989 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-10 02:42:13,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:42:13 BoogieIcfgContainer [2019-09-10 02:42:13,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:42:13,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:42:13,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:42:13,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:42:13,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:42:10" (1/3) ... [2019-09-10 02:42:13,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262ec320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:42:13, skipping insertion in model container [2019-09-10 02:42:13,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:42:11" (2/3) ... [2019-09-10 02:42:13,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262ec320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:42:13, skipping insertion in model container [2019-09-10 02:42:13,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:42:13" (3/3) ... [2019-09-10 02:42:14,001 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec6_product30.cil.c [2019-09-10 02:42:14,012 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:42:14,025 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:42:14,044 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:42:14,072 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:42:14,073 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:42:14,073 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:42:14,073 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:42:14,073 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:42:14,073 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:42:14,073 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:42:14,074 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:42:14,103 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states. [2019-09-10 02:42:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 02:42:14,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:14,132 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:42:14,135 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:14,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:14,142 INFO L82 PathProgramCache]: Analyzing trace with hash 2032051797, now seen corresponding path program 1 times [2019-09-10 02:42:14,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:14,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:14,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:14,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:14,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:42:14,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:14,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:42:14,851 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:14,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:42:14,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:42:14,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:42:14,876 INFO L87 Difference]: Start difference. First operand 552 states. Second operand 2 states. [2019-09-10 02:42:14,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:14,948 INFO L93 Difference]: Finished difference Result 510 states and 676 transitions. [2019-09-10 02:42:14,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:42:14,950 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 189 [2019-09-10 02:42:14,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:14,974 INFO L225 Difference]: With dead ends: 510 [2019-09-10 02:42:14,974 INFO L226 Difference]: Without dead ends: 501 [2019-09-10 02:42:14,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:42:15,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-09-10 02:42:15,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2019-09-10 02:42:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-09-10 02:42:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 665 transitions. [2019-09-10 02:42:15,083 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 665 transitions. Word has length 189 [2019-09-10 02:42:15,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:15,085 INFO L475 AbstractCegarLoop]: Abstraction has 501 states and 665 transitions. [2019-09-10 02:42:15,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:42:15,086 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 665 transitions. [2019-09-10 02:42:15,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 02:42:15,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:15,093 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:42:15,093 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:15,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:15,094 INFO L82 PathProgramCache]: Analyzing trace with hash -990311382, now seen corresponding path program 1 times [2019-09-10 02:42:15,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:15,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:15,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:15,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:15,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:15,353 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:42:15,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:15,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:42:15,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:15,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:42:15,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:42:15,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:42:15,357 INFO L87 Difference]: Start difference. First operand 501 states and 665 transitions. Second operand 3 states. [2019-09-10 02:42:15,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:15,425 INFO L93 Difference]: Finished difference Result 504 states and 668 transitions. [2019-09-10 02:42:15,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:42:15,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-09-10 02:42:15,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:15,432 INFO L225 Difference]: With dead ends: 504 [2019-09-10 02:42:15,432 INFO L226 Difference]: Without dead ends: 504 [2019-09-10 02:42:15,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:42:15,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-10 02:42:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 503. [2019-09-10 02:42:15,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-10 02:42:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 667 transitions. [2019-09-10 02:42:15,497 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 667 transitions. Word has length 190 [2019-09-10 02:42:15,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:15,497 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 667 transitions. [2019-09-10 02:42:15,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:42:15,498 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 667 transitions. [2019-09-10 02:42:15,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-10 02:42:15,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:15,503 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:42:15,503 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:15,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:15,503 INFO L82 PathProgramCache]: Analyzing trace with hash -733983558, now seen corresponding path program 1 times [2019-09-10 02:42:15,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:15,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:15,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:15,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:15,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:42:15,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:15,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:42:15,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:15,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:42:15,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:42:15,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:42:15,738 INFO L87 Difference]: Start difference. First operand 503 states and 667 transitions. Second operand 3 states. [2019-09-10 02:42:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:15,772 INFO L93 Difference]: Finished difference Result 544 states and 737 transitions. [2019-09-10 02:42:15,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:42:15,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-09-10 02:42:15,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:15,783 INFO L225 Difference]: With dead ends: 544 [2019-09-10 02:42:15,783 INFO L226 Difference]: Without dead ends: 544 [2019-09-10 02:42:15,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:42:15,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-09-10 02:42:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 543. [2019-09-10 02:42:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-10 02:42:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 736 transitions. [2019-09-10 02:42:15,823 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 736 transitions. Word has length 200 [2019-09-10 02:42:15,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:15,823 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 736 transitions. [2019-09-10 02:42:15,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:42:15,824 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 736 transitions. [2019-09-10 02:42:15,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-10 02:42:15,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:15,832 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:42:15,832 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:15,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:15,833 INFO L82 PathProgramCache]: Analyzing trace with hash 976247459, now seen corresponding path program 1 times [2019-09-10 02:42:15,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:15,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:15,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:15,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:15,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:42:16,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:16,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:42:16,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:16,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:42:16,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:42:16,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:42:16,035 INFO L87 Difference]: Start difference. First operand 543 states and 736 transitions. Second operand 3 states. [2019-09-10 02:42:16,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:16,075 INFO L93 Difference]: Finished difference Result 621 states and 869 transitions. [2019-09-10 02:42:16,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:42:16,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-09-10 02:42:16,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:16,083 INFO L225 Difference]: With dead ends: 621 [2019-09-10 02:42:16,084 INFO L226 Difference]: Without dead ends: 621 [2019-09-10 02:42:16,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:42:16,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-09-10 02:42:16,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 620. [2019-09-10 02:42:16,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-10 02:42:16,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 868 transitions. [2019-09-10 02:42:16,115 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 868 transitions. Word has length 201 [2019-09-10 02:42:16,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:16,115 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 868 transitions. [2019-09-10 02:42:16,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:42:16,116 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 868 transitions. [2019-09-10 02:42:16,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-10 02:42:16,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:16,121 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:42:16,121 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:16,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:16,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1623926726, now seen corresponding path program 1 times [2019-09-10 02:42:16,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:16,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:16,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:16,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:16,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:16,385 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:42:16,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:16,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:42:16,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:16,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:42:16,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:42:16,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:42:16,390 INFO L87 Difference]: Start difference. First operand 620 states and 868 transitions. Second operand 3 states. [2019-09-10 02:42:16,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:16,428 INFO L93 Difference]: Finished difference Result 769 states and 1121 transitions. [2019-09-10 02:42:16,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:42:16,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-09-10 02:42:16,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:16,438 INFO L225 Difference]: With dead ends: 769 [2019-09-10 02:42:16,439 INFO L226 Difference]: Without dead ends: 769 [2019-09-10 02:42:16,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:42:16,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-09-10 02:42:16,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 768. [2019-09-10 02:42:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-09-10 02:42:16,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1120 transitions. [2019-09-10 02:42:16,486 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1120 transitions. Word has length 202 [2019-09-10 02:42:16,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:16,486 INFO L475 AbstractCegarLoop]: Abstraction has 768 states and 1120 transitions. [2019-09-10 02:42:16,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:42:16,487 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1120 transitions. [2019-09-10 02:42:16,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 02:42:16,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:16,496 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:42:16,497 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:16,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:16,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1460269859, now seen corresponding path program 1 times [2019-09-10 02:42:16,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:16,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:16,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:16,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:16,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:42:16,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:16,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:42:16,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:16,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:42:16,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:42:16,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:42:16,738 INFO L87 Difference]: Start difference. First operand 768 states and 1120 transitions. Second operand 3 states. [2019-09-10 02:42:16,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:16,770 INFO L93 Difference]: Finished difference Result 1053 states and 1601 transitions. [2019-09-10 02:42:16,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:42:16,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-09-10 02:42:16,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:16,783 INFO L225 Difference]: With dead ends: 1053 [2019-09-10 02:42:16,784 INFO L226 Difference]: Without dead ends: 1053 [2019-09-10 02:42:16,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:42:16,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-09-10 02:42:16,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1052. [2019-09-10 02:42:16,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-09-10 02:42:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1600 transitions. [2019-09-10 02:42:16,842 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1600 transitions. Word has length 203 [2019-09-10 02:42:16,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:16,845 INFO L475 AbstractCegarLoop]: Abstraction has 1052 states and 1600 transitions. [2019-09-10 02:42:16,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:42:16,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1600 transitions. [2019-09-10 02:42:16,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-10 02:42:16,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:16,858 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:42:16,858 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:16,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:16,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1034024059, now seen corresponding path program 1 times [2019-09-10 02:42:16,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:16,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:16,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:16,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:16,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:42:17,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:17,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:42:17,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:17,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:42:17,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:42:17,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:42:17,285 INFO L87 Difference]: Start difference. First operand 1052 states and 1600 transitions. Second operand 11 states. [2019-09-10 02:42:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:22,169 INFO L93 Difference]: Finished difference Result 2900 states and 4070 transitions. [2019-09-10 02:42:22,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 02:42:22,169 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 206 [2019-09-10 02:42:22,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:22,185 INFO L225 Difference]: With dead ends: 2900 [2019-09-10 02:42:22,186 INFO L226 Difference]: Without dead ends: 2577 [2019-09-10 02:42:22,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 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-09-10 02:42:22,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2019-09-10 02:42:22,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 2562. [2019-09-10 02:42:22,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2562 states. [2019-09-10 02:42:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 3558 transitions. [2019-09-10 02:42:22,300 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 3558 transitions. Word has length 206 [2019-09-10 02:42:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:22,300 INFO L475 AbstractCegarLoop]: Abstraction has 2562 states and 3558 transitions. [2019-09-10 02:42:22,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:42:22,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 3558 transitions. [2019-09-10 02:42:22,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-10 02:42:22,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:22,308 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:42:22,308 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:22,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:22,309 INFO L82 PathProgramCache]: Analyzing trace with hash -587031347, now seen corresponding path program 1 times [2019-09-10 02:42:22,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:22,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:22,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:22,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:22,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:42:22,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:22,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 02:42:22,657 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:22,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:42:22,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:42:22,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:42:22,659 INFO L87 Difference]: Start difference. First operand 2562 states and 3558 transitions. Second operand 18 states. [2019-09-10 02:42:23,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:23,051 INFO L93 Difference]: Finished difference Result 2507 states and 3486 transitions. [2019-09-10 02:42:23,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 02:42:23,052 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 207 [2019-09-10 02:42:23,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:23,067 INFO L225 Difference]: With dead ends: 2507 [2019-09-10 02:42:23,068 INFO L226 Difference]: Without dead ends: 2182 [2019-09-10 02:42:23,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:42:23,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2019-09-10 02:42:23,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2142. [2019-09-10 02:42:23,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2142 states. [2019-09-10 02:42:23,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 3001 transitions. [2019-09-10 02:42:23,143 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 3001 transitions. Word has length 207 [2019-09-10 02:42:23,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:23,144 INFO L475 AbstractCegarLoop]: Abstraction has 2142 states and 3001 transitions. [2019-09-10 02:42:23,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:42:23,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 3001 transitions. [2019-09-10 02:42:23,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-10 02:42:23,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:23,151 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:42:23,151 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:23,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:23,152 INFO L82 PathProgramCache]: Analyzing trace with hash -978410275, now seen corresponding path program 1 times [2019-09-10 02:42:23,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:23,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:23,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:23,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:23,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:23,405 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:42:23,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:23,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:42:23,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:23,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:42:23,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:42:23,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:42:23,407 INFO L87 Difference]: Start difference. First operand 2142 states and 3001 transitions. Second operand 6 states. [2019-09-10 02:42:24,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:24,021 INFO L93 Difference]: Finished difference Result 4275 states and 6067 transitions. [2019-09-10 02:42:24,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:42:24,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 216 [2019-09-10 02:42:24,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:24,045 INFO L225 Difference]: With dead ends: 4275 [2019-09-10 02:42:24,045 INFO L226 Difference]: Without dead ends: 4275 [2019-09-10 02:42:24,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:42:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2019-09-10 02:42:24,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 4204. [2019-09-10 02:42:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4204 states. [2019-09-10 02:42:24,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4204 states to 4204 states and 5979 transitions. [2019-09-10 02:42:24,195 INFO L78 Accepts]: Start accepts. Automaton has 4204 states and 5979 transitions. Word has length 216 [2019-09-10 02:42:24,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:24,196 INFO L475 AbstractCegarLoop]: Abstraction has 4204 states and 5979 transitions. [2019-09-10 02:42:24,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:42:24,196 INFO L276 IsEmpty]: Start isEmpty. Operand 4204 states and 5979 transitions. [2019-09-10 02:42:24,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 02:42:24,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:24,208 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:42:24,209 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:24,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:24,209 INFO L82 PathProgramCache]: Analyzing trace with hash 422554938, now seen corresponding path program 1 times [2019-09-10 02:42:24,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:24,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:24,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:24,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:24,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:42:24,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:24,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:42:24,525 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:24,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:42:24,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:42:24,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:42:24,527 INFO L87 Difference]: Start difference. First operand 4204 states and 5979 transitions. Second operand 11 states. [2019-09-10 02:42:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:24,909 INFO L93 Difference]: Finished difference Result 4240 states and 6027 transitions. [2019-09-10 02:42:24,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:42:24,909 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 217 [2019-09-10 02:42:24,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:24,932 INFO L225 Difference]: With dead ends: 4240 [2019-09-10 02:42:24,932 INFO L226 Difference]: Without dead ends: 4222 [2019-09-10 02:42:24,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:42:24,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4222 states. [2019-09-10 02:42:25,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4222 to 4192. [2019-09-10 02:42:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4192 states. [2019-09-10 02:42:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4192 states to 4192 states and 5953 transitions. [2019-09-10 02:42:25,050 INFO L78 Accepts]: Start accepts. Automaton has 4192 states and 5953 transitions. Word has length 217 [2019-09-10 02:42:25,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:25,052 INFO L475 AbstractCegarLoop]: Abstraction has 4192 states and 5953 transitions. [2019-09-10 02:42:25,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:42:25,053 INFO L276 IsEmpty]: Start isEmpty. Operand 4192 states and 5953 transitions. [2019-09-10 02:42:25,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 02:42:25,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:25,063 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:42:25,064 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:25,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:25,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1009331057, now seen corresponding path program 1 times [2019-09-10 02:42:25,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:25,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:25,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:25,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:25,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:42:25,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:25,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:42:25,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:25,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:42:25,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:42:25,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:42:25,303 INFO L87 Difference]: Start difference. First operand 4192 states and 5953 transitions. Second operand 5 states. [2019-09-10 02:42:26,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:26,624 INFO L93 Difference]: Finished difference Result 10416 states and 14765 transitions. [2019-09-10 02:42:26,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:42:26,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 02:42:26,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:26,683 INFO L225 Difference]: With dead ends: 10416 [2019-09-10 02:42:26,683 INFO L226 Difference]: Without dead ends: 9560 [2019-09-10 02:42:26,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:42:26,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9560 states. [2019-09-10 02:42:26,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9560 to 9280. [2019-09-10 02:42:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9280 states. [2019-09-10 02:42:26,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9280 states to 9280 states and 13295 transitions. [2019-09-10 02:42:26,959 INFO L78 Accepts]: Start accepts. Automaton has 9280 states and 13295 transitions. Word has length 217 [2019-09-10 02:42:26,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:26,959 INFO L475 AbstractCegarLoop]: Abstraction has 9280 states and 13295 transitions. [2019-09-10 02:42:26,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:42:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 9280 states and 13295 transitions. [2019-09-10 02:42:26,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-10 02:42:26,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:26,985 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:42:26,986 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:26,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:26,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1393309593, now seen corresponding path program 1 times [2019-09-10 02:42:26,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:26,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:26,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:26,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:26,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:27,236 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:42:27,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:27,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:42:27,237 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:27,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:42:27,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:42:27,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:42:27,238 INFO L87 Difference]: Start difference. First operand 9280 states and 13295 transitions. Second operand 8 states. [2019-09-10 02:42:32,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:32,007 INFO L93 Difference]: Finished difference Result 18991 states and 29065 transitions. [2019-09-10 02:42:32,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:42:32,007 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 254 [2019-09-10 02:42:32,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:32,098 INFO L225 Difference]: With dead ends: 18991 [2019-09-10 02:42:32,098 INFO L226 Difference]: Without dead ends: 18991 [2019-09-10 02:42:32,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:42:32,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18991 states. [2019-09-10 02:42:32,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18991 to 12568. [2019-09-10 02:42:32,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12568 states. [2019-09-10 02:42:32,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12568 states to 12568 states and 20215 transitions. [2019-09-10 02:42:32,659 INFO L78 Accepts]: Start accepts. Automaton has 12568 states and 20215 transitions. Word has length 254 [2019-09-10 02:42:32,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:32,659 INFO L475 AbstractCegarLoop]: Abstraction has 12568 states and 20215 transitions. [2019-09-10 02:42:32,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:42:32,659 INFO L276 IsEmpty]: Start isEmpty. Operand 12568 states and 20215 transitions. [2019-09-10 02:42:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-10 02:42:32,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:32,720 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:42:32,720 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:32,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:32,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1618601407, now seen corresponding path program 1 times [2019-09-10 02:42:32,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:32,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:32,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:32,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:32,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:32,968 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:42:32,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:32,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:42:32,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:32,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:42:32,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:42:32,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:42:32,970 INFO L87 Difference]: Start difference. First operand 12568 states and 20215 transitions. Second operand 8 states. [2019-09-10 02:42:37,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:37,470 INFO L93 Difference]: Finished difference Result 26103 states and 45565 transitions. [2019-09-10 02:42:37,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:42:37,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 255 [2019-09-10 02:42:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:37,718 INFO L225 Difference]: With dead ends: 26103 [2019-09-10 02:42:37,718 INFO L226 Difference]: Without dead ends: 26103 [2019-09-10 02:42:37,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:42:37,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26103 states. [2019-09-10 02:42:38,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26103 to 19264. [2019-09-10 02:42:38,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19264 states. [2019-09-10 02:42:38,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19264 states to 19264 states and 35399 transitions. [2019-09-10 02:42:38,481 INFO L78 Accepts]: Start accepts. Automaton has 19264 states and 35399 transitions. Word has length 255 [2019-09-10 02:42:38,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:38,481 INFO L475 AbstractCegarLoop]: Abstraction has 19264 states and 35399 transitions. [2019-09-10 02:42:38,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:42:38,481 INFO L276 IsEmpty]: Start isEmpty. Operand 19264 states and 35399 transitions. [2019-09-10 02:42:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 02:42:38,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:38,614 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:42:38,614 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:38,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:38,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1902344509, now seen corresponding path program 1 times [2019-09-10 02:42:38,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:38,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:38,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:38,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:38,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:38,827 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:42:38,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:38,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:42:38,828 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:38,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:42:38,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:42:38,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:42:38,829 INFO L87 Difference]: Start difference. First operand 19264 states and 35399 transitions. Second operand 8 states. [2019-09-10 02:42:43,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:43,877 INFO L93 Difference]: Finished difference Result 40479 states and 81209 transitions. [2019-09-10 02:42:43,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:42:43,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 241 [2019-09-10 02:42:43,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:44,122 INFO L225 Difference]: With dead ends: 40479 [2019-09-10 02:42:44,122 INFO L226 Difference]: Without dead ends: 40479 [2019-09-10 02:42:44,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:42:44,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40479 states. [2019-09-10 02:42:46,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40479 to 32784. [2019-09-10 02:42:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32784 states. [2019-09-10 02:42:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32784 states to 32784 states and 68315 transitions. [2019-09-10 02:42:46,213 INFO L78 Accepts]: Start accepts. Automaton has 32784 states and 68315 transitions. Word has length 241 [2019-09-10 02:42:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:46,214 INFO L475 AbstractCegarLoop]: Abstraction has 32784 states and 68315 transitions. [2019-09-10 02:42:46,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:42:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 32784 states and 68315 transitions. [2019-09-10 02:42:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 02:42:46,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:46,405 INFO L399 BasicCegarLoop]: trace histogram [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-09-10 02:42:46,405 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:46,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:46,406 INFO L82 PathProgramCache]: Analyzing trace with hash -373263384, now seen corresponding path program 1 times [2019-09-10 02:42:46,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:46,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:46,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:46,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:46,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:46,662 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:42:46,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:46,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:42:46,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:46,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:42:46,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:42:46,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:42:46,663 INFO L87 Difference]: Start difference. First operand 32784 states and 68315 transitions. Second operand 11 states. [2019-09-10 02:42:48,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:48,393 INFO L93 Difference]: Finished difference Result 38306 states and 75553 transitions. [2019-09-10 02:42:48,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:42:48,394 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 245 [2019-09-10 02:42:48,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:48,595 INFO L225 Difference]: With dead ends: 38306 [2019-09-10 02:42:48,595 INFO L226 Difference]: Without dead ends: 38302 [2019-09-10 02:42:48,598 INFO L628 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-09-10 02:42:48,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38302 states. [2019-09-10 02:42:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38302 to 38012. [2019-09-10 02:42:50,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38012 states. [2019-09-10 02:42:50,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38012 states to 38012 states and 75191 transitions. [2019-09-10 02:42:50,196 INFO L78 Accepts]: Start accepts. Automaton has 38012 states and 75191 transitions. Word has length 245 [2019-09-10 02:42:50,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:50,197 INFO L475 AbstractCegarLoop]: Abstraction has 38012 states and 75191 transitions. [2019-09-10 02:42:50,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:42:50,197 INFO L276 IsEmpty]: Start isEmpty. Operand 38012 states and 75191 transitions. [2019-09-10 02:42:50,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-10 02:42:50,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:50,327 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:42:50,327 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:50,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:50,328 INFO L82 PathProgramCache]: Analyzing trace with hash 385061191, now seen corresponding path program 1 times [2019-09-10 02:42:50,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:50,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:50,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:50,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:50,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-10 02:42:50,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:50,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:42:50,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:50,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:42:50,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:42:50,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:42:50,520 INFO L87 Difference]: Start difference. First operand 38012 states and 75191 transitions. Second operand 6 states. [2019-09-10 02:42:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:51,222 INFO L93 Difference]: Finished difference Result 38090 states and 75275 transitions. [2019-09-10 02:42:51,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:42:51,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 263 [2019-09-10 02:42:51,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:51,406 INFO L225 Difference]: With dead ends: 38090 [2019-09-10 02:42:51,406 INFO L226 Difference]: Without dead ends: 38090 [2019-09-10 02:42:51,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:42:51,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38090 states. [2019-09-10 02:42:53,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38090 to 38088. [2019-09-10 02:42:53,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38088 states. [2019-09-10 02:42:53,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38088 states to 38088 states and 75273 transitions. [2019-09-10 02:42:53,784 INFO L78 Accepts]: Start accepts. Automaton has 38088 states and 75273 transitions. Word has length 263 [2019-09-10 02:42:53,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:53,785 INFO L475 AbstractCegarLoop]: Abstraction has 38088 states and 75273 transitions. [2019-09-10 02:42:53,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:42:53,785 INFO L276 IsEmpty]: Start isEmpty. Operand 38088 states and 75273 transitions. [2019-09-10 02:42:53,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 02:42:53,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:53,965 INFO L399 BasicCegarLoop]: trace histogram [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, 1] [2019-09-10 02:42:53,965 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:53,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:53,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1614652778, now seen corresponding path program 1 times [2019-09-10 02:42:53,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:53,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:53,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:53,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:53,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:42:54,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:54,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:42:54,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:54,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:42:54,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:42:54,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:42:54,177 INFO L87 Difference]: Start difference. First operand 38088 states and 75273 transitions. Second operand 6 states. [2019-09-10 02:42:54,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:54,830 INFO L93 Difference]: Finished difference Result 38208 states and 74835 transitions. [2019-09-10 02:42:54,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:42:54,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 246 [2019-09-10 02:42:54,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:55,027 INFO L225 Difference]: With dead ends: 38208 [2019-09-10 02:42:55,028 INFO L226 Difference]: Without dead ends: 38208 [2019-09-10 02:42:55,029 INFO L628 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-09-10 02:42:55,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38208 states. [2019-09-10 02:42:56,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38208 to 38208. [2019-09-10 02:42:56,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38208 states. [2019-09-10 02:42:56,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38208 states to 38208 states and 74835 transitions. [2019-09-10 02:42:56,419 INFO L78 Accepts]: Start accepts. Automaton has 38208 states and 74835 transitions. Word has length 246 [2019-09-10 02:42:56,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:56,419 INFO L475 AbstractCegarLoop]: Abstraction has 38208 states and 74835 transitions. [2019-09-10 02:42:56,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:42:56,419 INFO L276 IsEmpty]: Start isEmpty. Operand 38208 states and 74835 transitions. [2019-09-10 02:42:56,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 02:42:56,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:56,612 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-09-10 02:42:56,612 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:56,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:56,612 INFO L82 PathProgramCache]: Analyzing trace with hash 948513858, now seen corresponding path program 1 times [2019-09-10 02:42:56,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:56,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:56,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:56,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:56,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:57,045 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:42:57,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:57,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 02:42:57,046 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:57,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 02:42:57,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 02:42:57,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:42:57,049 INFO L87 Difference]: Start difference. First operand 38208 states and 74835 transitions. Second operand 22 states. [2019-09-10 02:43:14,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:14,505 INFO L93 Difference]: Finished difference Result 84281 states and 164003 transitions. [2019-09-10 02:43:14,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 02:43:14,505 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 247 [2019-09-10 02:43:14,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:14,987 INFO L225 Difference]: With dead ends: 84281 [2019-09-10 02:43:14,987 INFO L226 Difference]: Without dead ends: 84281 [2019-09-10 02:43:14,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=483, Invalid=4209, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 02:43:15,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84281 states. [2019-09-10 02:43:17,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84281 to 82460. [2019-09-10 02:43:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82460 states. [2019-09-10 02:43:17,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82460 states to 82460 states and 160814 transitions. [2019-09-10 02:43:17,301 INFO L78 Accepts]: Start accepts. Automaton has 82460 states and 160814 transitions. Word has length 247 [2019-09-10 02:43:17,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:17,301 INFO L475 AbstractCegarLoop]: Abstraction has 82460 states and 160814 transitions. [2019-09-10 02:43:17,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 02:43:17,301 INFO L276 IsEmpty]: Start isEmpty. Operand 82460 states and 160814 transitions. [2019-09-10 02:43:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 02:43:17,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:17,526 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-09-10 02:43:17,527 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:17,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:17,527 INFO L82 PathProgramCache]: Analyzing trace with hash -783352892, now seen corresponding path program 1 times [2019-09-10 02:43:17,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:17,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:17,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:17,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:17,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:17,752 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:43:17,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:17,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:43:17,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:17,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:43:17,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:43:17,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:43:17,755 INFO L87 Difference]: Start difference. First operand 82460 states and 160814 transitions. Second operand 6 states. [2019-09-10 02:43:20,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:20,476 INFO L93 Difference]: Finished difference Result 82206 states and 141293 transitions. [2019-09-10 02:43:20,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:43:20,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-09-10 02:43:20,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:20,867 INFO L225 Difference]: With dead ends: 82206 [2019-09-10 02:43:20,867 INFO L226 Difference]: Without dead ends: 82206 [2019-09-10 02:43:20,868 INFO L628 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-09-10 02:43:20,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82206 states. [2019-09-10 02:43:22,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82206 to 82173. [2019-09-10 02:43:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82173 states. [2019-09-10 02:43:23,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82173 states to 82173 states and 141254 transitions. [2019-09-10 02:43:23,377 INFO L78 Accepts]: Start accepts. Automaton has 82173 states and 141254 transitions. Word has length 249 [2019-09-10 02:43:23,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:23,377 INFO L475 AbstractCegarLoop]: Abstraction has 82173 states and 141254 transitions. [2019-09-10 02:43:23,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:43:23,377 INFO L276 IsEmpty]: Start isEmpty. Operand 82173 states and 141254 transitions. [2019-09-10 02:43:23,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 02:43:23,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:23,555 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:23,555 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:23,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:23,555 INFO L82 PathProgramCache]: Analyzing trace with hash -142014074, now seen corresponding path program 1 times [2019-09-10 02:43:23,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:23,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:23,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:23,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:23,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:43:23,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:23,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:43:23,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:23,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:43:23,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:43:23,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:43:23,709 INFO L87 Difference]: Start difference. First operand 82173 states and 141254 transitions. Second operand 5 states. [2019-09-10 02:43:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:24,035 INFO L93 Difference]: Finished difference Result 71911 states and 126564 transitions. [2019-09-10 02:43:24,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:43:24,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2019-09-10 02:43:24,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:24,254 INFO L225 Difference]: With dead ends: 71911 [2019-09-10 02:43:24,254 INFO L226 Difference]: Without dead ends: 70441 [2019-09-10 02:43:24,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:43:24,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70441 states. [2019-09-10 02:43:27,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70441 to 69802. [2019-09-10 02:43:27,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69802 states. [2019-09-10 02:43:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69802 states to 69802 states and 123638 transitions. [2019-09-10 02:43:28,167 INFO L78 Accepts]: Start accepts. Automaton has 69802 states and 123638 transitions. Word has length 249 [2019-09-10 02:43:28,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:28,167 INFO L475 AbstractCegarLoop]: Abstraction has 69802 states and 123638 transitions. [2019-09-10 02:43:28,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:43:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 69802 states and 123638 transitions. [2019-09-10 02:43:28,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-10 02:43:28,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:28,325 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:28,325 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:28,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:28,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1587759466, now seen corresponding path program 1 times [2019-09-10 02:43:28,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:28,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:28,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:28,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:28,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:43:28,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:28,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 02:43:28,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:28,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:43:28,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:43:28,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:43:28,670 INFO L87 Difference]: Start difference. First operand 69802 states and 123638 transitions. Second operand 18 states. [2019-09-10 02:43:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:41,123 INFO L93 Difference]: Finished difference Result 72200 states and 127545 transitions. [2019-09-10 02:43:41,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 02:43:41,123 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 266 [2019-09-10 02:43:41,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:41,336 INFO L225 Difference]: With dead ends: 72200 [2019-09-10 02:43:41,336 INFO L226 Difference]: Without dead ends: 72200 [2019-09-10 02:43:41,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=312, Invalid=2138, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 02:43:41,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72200 states. [2019-09-10 02:43:45,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72200 to 70823. [2019-09-10 02:43:45,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70823 states. [2019-09-10 02:43:45,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70823 states to 70823 states and 125332 transitions. [2019-09-10 02:43:45,388 INFO L78 Accepts]: Start accepts. Automaton has 70823 states and 125332 transitions. Word has length 266 [2019-09-10 02:43:45,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:45,389 INFO L475 AbstractCegarLoop]: Abstraction has 70823 states and 125332 transitions. [2019-09-10 02:43:45,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:43:45,389 INFO L276 IsEmpty]: Start isEmpty. Operand 70823 states and 125332 transitions. [2019-09-10 02:43:45,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-10 02:43:45,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:45,551 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:45,552 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:45,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:45,552 INFO L82 PathProgramCache]: Analyzing trace with hash 188969777, now seen corresponding path program 1 times [2019-09-10 02:43:45,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:45,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:45,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:45,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:45,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:43:45,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:45,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 02:43:45,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:45,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 02:43:45,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 02:43:45,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:43:45,836 INFO L87 Difference]: Start difference. First operand 70823 states and 125332 transitions. Second operand 16 states. [2019-09-10 02:43:46,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:46,555 INFO L93 Difference]: Finished difference Result 70639 states and 124684 transitions. [2019-09-10 02:43:46,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:43:46,555 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 266 [2019-09-10 02:43:46,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:46,812 INFO L225 Difference]: With dead ends: 70639 [2019-09-10 02:43:46,812 INFO L226 Difference]: Without dead ends: 70189 [2019-09-10 02:43:46,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:43:46,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70189 states. [2019-09-10 02:43:48,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70189 to 70075. [2019-09-10 02:43:48,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70075 states. [2019-09-10 02:43:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70075 states to 70075 states and 123806 transitions. [2019-09-10 02:43:48,572 INFO L78 Accepts]: Start accepts. Automaton has 70075 states and 123806 transitions. Word has length 266 [2019-09-10 02:43:48,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:48,572 INFO L475 AbstractCegarLoop]: Abstraction has 70075 states and 123806 transitions. [2019-09-10 02:43:48,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 02:43:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 70075 states and 123806 transitions. [2019-09-10 02:43:49,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-10 02:43:49,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:49,276 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:49,276 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:49,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:49,277 INFO L82 PathProgramCache]: Analyzing trace with hash 2033652514, now seen corresponding path program 1 times [2019-09-10 02:43:49,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:49,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:49,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:49,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:49,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:49,438 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:43:49,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:49,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:43:49,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:49,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:43:49,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:43:49,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:43:49,440 INFO L87 Difference]: Start difference. First operand 70075 states and 123806 transitions. Second operand 5 states. [2019-09-10 02:43:49,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:49,721 INFO L93 Difference]: Finished difference Result 70362 states and 123996 transitions. [2019-09-10 02:43:49,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:43:49,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 266 [2019-09-10 02:43:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:50,032 INFO L225 Difference]: With dead ends: 70362 [2019-09-10 02:43:50,032 INFO L226 Difference]: Without dead ends: 68984 [2019-09-10 02:43:50,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:43:50,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68984 states. [2019-09-10 02:43:51,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68984 to 65497. [2019-09-10 02:43:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65497 states. [2019-09-10 02:43:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65497 states to 65497 states and 117491 transitions. [2019-09-10 02:43:51,628 INFO L78 Accepts]: Start accepts. Automaton has 65497 states and 117491 transitions. Word has length 266 [2019-09-10 02:43:51,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:51,628 INFO L475 AbstractCegarLoop]: Abstraction has 65497 states and 117491 transitions. [2019-09-10 02:43:51,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:43:51,628 INFO L276 IsEmpty]: Start isEmpty. Operand 65497 states and 117491 transitions. [2019-09-10 02:43:51,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-10 02:43:51,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:51,794 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:51,794 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:51,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:51,795 INFO L82 PathProgramCache]: Analyzing trace with hash 337241735, now seen corresponding path program 1 times [2019-09-10 02:43:51,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:51,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:51,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:51,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:51,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:52,172 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:43:52,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:52,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 02:43:52,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:52,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:43:52,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:43:52,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:43:52,174 INFO L87 Difference]: Start difference. First operand 65497 states and 117491 transitions. Second operand 18 states. [2019-09-10 02:44:05,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:05,382 INFO L93 Difference]: Finished difference Result 66568 states and 119102 transitions. [2019-09-10 02:44:05,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 02:44:05,383 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 267 [2019-09-10 02:44:05,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:05,608 INFO L225 Difference]: With dead ends: 66568 [2019-09-10 02:44:05,608 INFO L226 Difference]: Without dead ends: 66568 [2019-09-10 02:44:05,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=312, Invalid=2138, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 02:44:05,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66568 states. [2019-09-10 02:44:07,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66568 to 65587. [2019-09-10 02:44:07,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65587 states. [2019-09-10 02:44:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65587 states to 65587 states and 117603 transitions. [2019-09-10 02:44:07,407 INFO L78 Accepts]: Start accepts. Automaton has 65587 states and 117603 transitions. Word has length 267 [2019-09-10 02:44:07,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:07,408 INFO L475 AbstractCegarLoop]: Abstraction has 65587 states and 117603 transitions. [2019-09-10 02:44:07,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:44:07,408 INFO L276 IsEmpty]: Start isEmpty. Operand 65587 states and 117603 transitions. [2019-09-10 02:44:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-10 02:44:07,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:07,583 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:07,583 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:07,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:07,584 INFO L82 PathProgramCache]: Analyzing trace with hash -71582490, now seen corresponding path program 1 times [2019-09-10 02:44:07,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:07,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:07,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:07,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:07,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-10 02:44:07,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:07,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:44:07,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:07,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:44:07,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:44:07,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:44:07,750 INFO L87 Difference]: Start difference. First operand 65587 states and 117603 transitions. Second operand 6 states. [2019-09-10 02:44:08,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:08,511 INFO L93 Difference]: Finished difference Result 65767 states and 117384 transitions. [2019-09-10 02:44:08,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:44:08,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 267 [2019-09-10 02:44:08,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:08,739 INFO L225 Difference]: With dead ends: 65767 [2019-09-10 02:44:08,739 INFO L226 Difference]: Without dead ends: 65767 [2019-09-10 02:44:08,739 INFO L628 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-09-10 02:44:08,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65767 states. [2019-09-10 02:44:10,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65767 to 65657. [2019-09-10 02:44:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65657 states. [2019-09-10 02:44:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65657 states to 65657 states and 117247 transitions. [2019-09-10 02:44:10,916 INFO L78 Accepts]: Start accepts. Automaton has 65657 states and 117247 transitions. Word has length 267 [2019-09-10 02:44:10,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:10,917 INFO L475 AbstractCegarLoop]: Abstraction has 65657 states and 117247 transitions. [2019-09-10 02:44:10,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:44:10,917 INFO L276 IsEmpty]: Start isEmpty. Operand 65657 states and 117247 transitions. [2019-09-10 02:44:11,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-10 02:44:11,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:11,087 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:11,087 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:11,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:11,088 INFO L82 PathProgramCache]: Analyzing trace with hash 196768569, now seen corresponding path program 1 times [2019-09-10 02:44:11,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:11,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:11,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:11,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:11,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:44:11,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:11,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:44:11,245 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:11,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:44:11,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:44:11,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:44:11,246 INFO L87 Difference]: Start difference. First operand 65657 states and 117247 transitions. Second operand 6 states. [2019-09-10 02:44:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:11,975 INFO L93 Difference]: Finished difference Result 65657 states and 112153 transitions. [2019-09-10 02:44:11,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:44:11,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 252 [2019-09-10 02:44:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:12,182 INFO L225 Difference]: With dead ends: 65657 [2019-09-10 02:44:12,182 INFO L226 Difference]: Without dead ends: 65657 [2019-09-10 02:44:12,182 INFO L628 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-09-10 02:44:12,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65657 states. [2019-09-10 02:44:13,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65657 to 65657. [2019-09-10 02:44:13,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65657 states. [2019-09-10 02:44:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65657 states to 65657 states and 112153 transitions. [2019-09-10 02:44:13,577 INFO L78 Accepts]: Start accepts. Automaton has 65657 states and 112153 transitions. Word has length 252 [2019-09-10 02:44:13,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:13,578 INFO L475 AbstractCegarLoop]: Abstraction has 65657 states and 112153 transitions. [2019-09-10 02:44:13,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:44:13,578 INFO L276 IsEmpty]: Start isEmpty. Operand 65657 states and 112153 transitions. [2019-09-10 02:44:14,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 02:44:14,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:14,393 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:14,393 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:14,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:14,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1034671747, now seen corresponding path program 1 times [2019-09-10 02:44:14,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:14,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:14,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:14,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:14,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:44:14,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:44:14,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:44:14,572 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 257 with the following transitions: [2019-09-10 02:44:14,575 INFO L207 CegarAbsIntRunner]: [59], [62], [72], [117], [133], [136], [145], [146], [149], [150], [151], [153], [249], [252], [258], [263], [265], [269], [272], [273], [274], [277], [283], [319], [321], [323], [326], [347], [350], [359], [370], [372], [373], [376], [386], [389], [391], [394], [396], [398], [461], [464], [473], [574], [577], [587], [638], [640], [643], [645], [647], [648], [649], [651], [652], [653], [669], [672], [686], [689], [692], [706], [735], [736], [747], [749], [751], [754], [758], [761], [763], [764], [766], [769], [773], [797], [801], [804], [812], [815], [846], [880], [889], [893], [895], [897], [900], [903], [905], [1089], [1092], [1095], [1126], [1127], [1130], [1133], [1177], [1178], [1181], [1184], [1187], [1231], [1250], [1254], [1265], [1268], [1269], [1272], [1275], [1306], [1307], [1309], [1392], [1395], [1401], [1422], [1425], [1439], [1445], [1448], [1457], [1473], [1476], [1479], [1510], [1524], [1527], [1529], [1531], [1533], [1538], [1545], [1547], [1548], [1671], [1673], [1675], [1677], [1678], [1706], [1716], [1717], [1718], [1719], [1720], [1721], [1724], [1725], [1726], [1727], [1728], [1730], [1731], [1732], [1733], [1746], [1747], [1748], [1749], [1750], [1751], [1752], [1753], [1754], [1766], [1767], [1768], [1769], [1770], [1771], [1804], [1805], [1806], [1807], [1808], [1809], [1810], [1811], [1812], [1813], [1814], [1815], [1828], [1829], [1830], [1831], [1832], [1834], [1835], [1840], [1841], [1842], [1843], [1844], [1845], [1846], [1847], [1848], [1850], [1851], [1852], [1853], [1868], [1886], [1887], [1904], [1906], [1907], [1908], [1910], [1911], [1912], [1913], [1914], [1915], [1916], [1922], [1923], [1924], [1925], [1926], [1927], [1928], [1930], [1931], [1938], [1939], [1940], [1941], [1942], [1943], [1944], [1945], [1946] [2019-09-10 02:44:14,638 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:44:14,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:44:14,819 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:44:14,821 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 299 root evaluator evaluations with a maximum evaluation depth of 0. Performed 299 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 386 variables. [2019-09-10 02:44:14,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:14,828 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:44:14,933 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:44:14,934 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:44:14,940 INFO L420 sIntCurrentIteration]: We unified 255 AI predicates to 255 [2019-09-10 02:44:14,940 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:44:14,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:44:14,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2019-09-10 02:44:14,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:14,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:44:14,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:44:14,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:44:14,943 INFO L87 Difference]: Start difference. First operand 65657 states and 112153 transitions. Second operand 2 states. [2019-09-10 02:44:14,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:14,944 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:44:14,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:44:14,945 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 256 [2019-09-10 02:44:14,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:14,945 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:44:14,945 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:44:14,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:44:14,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:44:14,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:44:14,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:44:14,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:44:14,946 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 256 [2019-09-10 02:44:14,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:14,947 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:44:14,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:44:14,947 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:44:14,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:44:14,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:44:14 BoogieIcfgContainer [2019-09-10 02:44:14,953 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:44:14,956 INFO L168 Benchmark]: Toolchain (without parser) took 124859.04 ms. Allocated memory was 133.2 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 86.6 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-09-10 02:44:14,956 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:44:14,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1163.55 ms. Allocated memory was 133.2 MB in the beginning and 201.9 MB in the end (delta: 68.7 MB). Free memory was 86.4 MB in the beginning and 130.0 MB in the end (delta: -43.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 7.1 GB. [2019-09-10 02:44:14,958 INFO L168 Benchmark]: Boogie Preprocessor took 202.17 ms. Allocated memory is still 201.9 MB. Free memory was 130.0 MB in the beginning and 120.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:44:14,959 INFO L168 Benchmark]: RCFGBuilder took 2528.26 ms. Allocated memory was 201.9 MB in the beginning and 263.2 MB in the end (delta: 61.3 MB). Free memory was 120.6 MB in the beginning and 150.7 MB in the end (delta: -30.0 MB). Peak memory consumption was 79.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:44:14,960 INFO L168 Benchmark]: TraceAbstraction took 120960.44 ms. Allocated memory was 263.2 MB in the beginning and 3.1 GB in the end (delta: 2.8 GB). Free memory was 150.7 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 979.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:44:14,966 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1163.55 ms. Allocated memory was 133.2 MB in the beginning and 201.9 MB in the end (delta: 68.7 MB). Free memory was 86.4 MB in the beginning and 130.0 MB in the end (delta: -43.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 202.17 ms. Allocated memory is still 201.9 MB. Free memory was 130.0 MB in the beginning and 120.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2528.26 ms. Allocated memory was 201.9 MB in the beginning and 263.2 MB in the end (delta: 61.3 MB). Free memory was 120.6 MB in the beginning and 150.7 MB in the end (delta: -30.0 MB). Peak memory consumption was 79.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 120960.44 ms. Allocated memory was 263.2 MB in the beginning and 3.1 GB in the end (delta: 2.8 GB). Free memory was 150.7 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 979.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3017]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 116 procedures, 801 locations, 1 error locations. SAFE Result, 120.8s OverallTime, 27 OverallIterations, 4 TraceHistogramMax, 77.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20049 SDtfs, 19516 SDslu, 74141 SDs, 0 SdLazy, 62188 SolverSat, 6087 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 55.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 768 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2543 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82460occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.066666666666667 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 31.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 30252 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 6337 NumberOfCodeBlocks, 6337 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6310 ConstructedInterpolants, 0 QuantifiedInterpolants, 1969456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 26 PerfectInterpolantSequences, 1167/1170 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...