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_spec11_product15.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:50:19,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:50:19,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:50:19,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:50:19,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:50:19,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:50:19,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:50:19,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:50:19,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:50:19,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:50:19,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:50:19,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:50:19,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:50:19,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:50:19,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:50:19,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:50:19,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:50:19,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:50:19,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:50:19,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:50:19,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:50:19,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:50:19,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:50:19,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:50:19,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:50:19,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:50:19,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:50:19,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:50:19,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:50:19,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:50:19,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:50:19,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:50:19,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:50:19,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:50:19,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:50:19,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:50:19,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:50:19,233 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:50:19,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:50:19,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:50:19,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:50:19,235 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-10-03 02:50:19,250 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:50:19,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:50:19,251 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:50:19,253 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:50:19,254 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:50:19,254 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:50:19,255 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:50:19,255 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:50:19,255 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:50:19,255 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:50:19,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:50:19,257 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:50:19,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:50:19,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:50:19,258 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:50:19,258 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:50:19,258 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:50:19,259 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:50:19,259 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:50:19,259 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:50:19,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:50:19,260 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:50:19,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:50:19,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:50:19,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:50:19,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:50:19,261 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:50:19,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:50:19,262 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:50:19,262 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:50:19,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:50:19,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:50:19,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:50:19,322 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:50:19,322 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:50:19,323 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec11_product15.cil.c [2019-10-03 02:50:19,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff3ded43/54412f66352a45c0a335d16f5f0b8d1a/FLAG45d9db41c [2019-10-03 02:50:20,030 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:50:20,031 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec11_product15.cil.c [2019-10-03 02:50:20,052 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff3ded43/54412f66352a45c0a335d16f5f0b8d1a/FLAG45d9db41c [2019-10-03 02:50:20,162 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff3ded43/54412f66352a45c0a335d16f5f0b8d1a [2019-10-03 02:50:20,172 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:50:20,174 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:50:20,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:50:20,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:50:20,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:50:20,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:50:20" (1/1) ... [2019-10-03 02:50:20,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373eb7ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:20, skipping insertion in model container [2019-10-03 02:50:20,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:50:20" (1/1) ... [2019-10-03 02:50:20,190 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:50:20,264 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:50:21,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:50:21,123 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:50:21,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:50:21,326 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:50:21,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:21 WrapperNode [2019-10-03 02:50:21,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:50:21,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:50:21,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:50:21,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:50:21,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:21" (1/1) ... [2019-10-03 02:50:21,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:21" (1/1) ... [2019-10-03 02:50:21,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:21" (1/1) ... [2019-10-03 02:50:21,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:21" (1/1) ... [2019-10-03 02:50:21,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:21" (1/1) ... [2019-10-03 02:50:21,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:21" (1/1) ... [2019-10-03 02:50:21,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:21" (1/1) ... [2019-10-03 02:50:21,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:50:21,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:50:21,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:50:21,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:50:21,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:50:21,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:50:21,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:50:21,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:50:21,581 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:50:21,581 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:50:21,581 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:50:21,582 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:50:21,582 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:50:21,582 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:50:21,582 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:50:21,582 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:50:21,583 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:50:21,583 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:50:21,583 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:50:21,583 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:50:21,584 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:50:21,584 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:50:21,584 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:50:21,584 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:50:21,584 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:50:21,585 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:50:21,585 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:50:21,585 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:50:21,585 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:50:21,586 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-10-03 02:50:21,586 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:50:21,586 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-03 02:50:21,586 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:50:21,586 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:50:21,587 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-03 02:50:21,587 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AutoResponder [2019-10-03 02:50:21,587 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:50:21,587 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:50:21,587 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:50:21,587 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:50:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:50:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:50:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:50:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:50:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:50:21,589 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-03 02:50:21,589 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:50:21,589 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:50:21,589 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:50:21,589 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:50:21,589 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:50:21,590 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:50:21,590 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:50:21,590 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:50:21,590 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:50:21,590 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:50:21,591 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:50:21,591 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:50:21,591 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:50:21,591 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:50:21,591 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:50:21,591 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:50:21,592 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:50:21,592 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:50:21,592 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:50:21,592 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:50:21,592 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:50:21,592 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:50:21,593 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:50:21,593 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:50:21,593 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:50:21,593 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:50:21,593 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:50:21,594 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:50:21,594 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:50:21,594 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:50:21,594 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:50:21,594 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:50:21,595 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:50:21,595 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:50:21,595 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:50:21,595 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:50:21,595 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-03 02:50:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:50:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-03 02:50:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:50:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-03 02:50:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:50:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:50:21,597 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:50:21,597 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:50:21,597 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:50:21,597 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:50:21,597 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:50:21,598 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:50:21,598 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:50:21,598 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:50:21,598 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:50:21,598 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:50:21,598 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:50:21,599 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:50:21,599 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-03 02:50:21,599 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:50:21,599 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:50:21,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:50:21,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:50:21,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:50:21,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:50:21,600 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-03 02:50:21,600 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:50:21,601 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-03 02:50:21,601 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:50:21,601 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:50:21,601 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:50:21,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:50:21,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:50:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:50:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:50:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:50:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:50:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:50:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:50:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:50:21,603 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:50:21,603 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:50:21,603 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:50:21,603 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:50:21,603 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:50:21,603 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:50:21,604 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:50:21,604 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:50:21,604 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:50:21,604 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:50:21,604 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:50:21,604 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:50:21,604 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:50:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:50:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:50:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:50:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:50:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-10-03 02:50:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:50:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:50:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:50:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:50:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:50:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:50:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:50:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:50:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:50:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:50:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:50:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:50:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:50:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:50:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:50:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:50:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:50:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:50:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:50:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:50:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:50:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-03 02:50:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-03 02:50:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-03 02:50:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AutoResponder [2019-10-03 02:50:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:50:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:50:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:50:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:50:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:50:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:50:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:50:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:50:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:50:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:50:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:50:21,611 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:50:21,611 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:50:21,611 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:50:21,611 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:50:21,611 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:50:21,611 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:50:21,611 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:50:21,612 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:50:21,612 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:50:21,612 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:50:21,612 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:50:21,612 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:50:21,612 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:50:21,612 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:50:21,613 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-03 02:50:21,613 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:50:21,613 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:50:21,613 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:50:21,613 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:50:21,613 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:50:21,613 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:50:21,613 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:50:21,614 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:50:21,614 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:50:21,614 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:50:21,614 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:50:21,614 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:50:21,614 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:50:21,614 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:50:21,615 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:50:21,615 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:50:21,615 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:50:21,615 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:50:21,615 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:50:21,615 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:50:21,615 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-03 02:50:21,616 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-03 02:50:21,616 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-03 02:50:21,616 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:50:21,616 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:50:21,616 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:50:21,616 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:50:21,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:50:21,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:50:21,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:50:21,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:50:21,617 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:50:21,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:50:21,617 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:50:21,617 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:50:21,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:50:21,618 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:50:21,618 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:50:21,618 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:50:21,618 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:50:21,618 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:50:21,618 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-03 02:50:21,619 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-03 02:50:21,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:50:21,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:50:21,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:50:23,730 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:50:23,731 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:50:23,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:50:23 BoogieIcfgContainer [2019-10-03 02:50:23,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:50:23,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:50:23,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:50:23,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:50:23,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:50:20" (1/3) ... [2019-10-03 02:50:23,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6858de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:50:23, skipping insertion in model container [2019-10-03 02:50:23,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:21" (2/3) ... [2019-10-03 02:50:23,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6858de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:50:23, skipping insertion in model container [2019-10-03 02:50:23,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:50:23" (3/3) ... [2019-10-03 02:50:23,741 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec11_product15.cil.c [2019-10-03 02:50:23,752 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:50:23,761 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:50:23,780 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:50:23,809 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:50:23,809 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:50:23,809 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:50:23,810 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:50:23,810 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:50:23,810 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:50:23,810 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:50:23,810 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:50:23,838 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states. [2019-10-03 02:50:23,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-03 02:50:23,867 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:23,869 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:23,871 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:23,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:23,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1009460557, now seen corresponding path program 1 times [2019-10-03 02:50:23,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:23,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:23,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:23,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:23,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:24,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:24,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:50:24,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:24,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:50:24,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:50:24,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:50:24,554 INFO L87 Difference]: Start difference. First operand 463 states. Second operand 2 states. [2019-10-03 02:50:24,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:24,615 INFO L93 Difference]: Finished difference Result 436 states and 578 transitions. [2019-10-03 02:50:24,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:50:24,617 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 184 [2019-10-03 02:50:24,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:24,639 INFO L225 Difference]: With dead ends: 436 [2019-10-03 02:50:24,639 INFO L226 Difference]: Without dead ends: 427 [2019-10-03 02:50:24,641 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:50:24,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-10-03 02:50:24,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2019-10-03 02:50:24,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-10-03 02:50:24,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 567 transitions. [2019-10-03 02:50:24,733 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 567 transitions. Word has length 184 [2019-10-03 02:50:24,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:24,735 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 567 transitions. [2019-10-03 02:50:24,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:50:24,736 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 567 transitions. [2019-10-03 02:50:24,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-03 02:50:24,742 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:24,743 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:24,743 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:24,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:24,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1618025728, now seen corresponding path program 1 times [2019-10-03 02:50:24,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:24,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:24,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:24,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:24,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:25,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:25,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:25,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:25,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:25,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:25,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:25,046 INFO L87 Difference]: Start difference. First operand 427 states and 567 transitions. Second operand 3 states. [2019-10-03 02:50:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:25,107 INFO L93 Difference]: Finished difference Result 430 states and 570 transitions. [2019-10-03 02:50:25,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:25,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-10-03 02:50:25,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:25,116 INFO L225 Difference]: With dead ends: 430 [2019-10-03 02:50:25,118 INFO L226 Difference]: Without dead ends: 430 [2019-10-03 02:50:25,119 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-10-03 02:50:25,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 429. [2019-10-03 02:50:25,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-10-03 02:50:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 569 transitions. [2019-10-03 02:50:25,174 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 569 transitions. Word has length 185 [2019-10-03 02:50:25,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:25,176 INFO L475 AbstractCegarLoop]: Abstraction has 429 states and 569 transitions. [2019-10-03 02:50:25,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:25,176 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 569 transitions. [2019-10-03 02:50:25,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-03 02:50:25,184 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:25,184 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:25,185 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:25,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:25,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1065076368, now seen corresponding path program 1 times [2019-10-03 02:50:25,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:25,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:25,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:25,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:25,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:25,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:25,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:25,461 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:25,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:25,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:25,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:25,468 INFO L87 Difference]: Start difference. First operand 429 states and 569 transitions. Second operand 3 states. [2019-10-03 02:50:25,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:25,503 INFO L93 Difference]: Finished difference Result 470 states and 639 transitions. [2019-10-03 02:50:25,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:25,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-10-03 02:50:25,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:25,509 INFO L225 Difference]: With dead ends: 470 [2019-10-03 02:50:25,509 INFO L226 Difference]: Without dead ends: 470 [2019-10-03 02:50:25,509 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:25,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-10-03 02:50:25,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 469. [2019-10-03 02:50:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-10-03 02:50:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 638 transitions. [2019-10-03 02:50:25,535 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 638 transitions. Word has length 195 [2019-10-03 02:50:25,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:25,536 INFO L475 AbstractCegarLoop]: Abstraction has 469 states and 638 transitions. [2019-10-03 02:50:25,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:25,536 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 638 transitions. [2019-10-03 02:50:25,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-03 02:50:25,544 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:25,546 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:25,546 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:25,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:25,547 INFO L82 PathProgramCache]: Analyzing trace with hash 328316479, now seen corresponding path program 1 times [2019-10-03 02:50:25,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:25,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:25,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:25,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:25,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:25,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:25,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:25,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:25,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:25,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:25,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:25,719 INFO L87 Difference]: Start difference. First operand 469 states and 638 transitions. Second operand 3 states. [2019-10-03 02:50:25,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:25,740 INFO L93 Difference]: Finished difference Result 547 states and 771 transitions. [2019-10-03 02:50:25,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:25,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-03 02:50:25,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:25,745 INFO L225 Difference]: With dead ends: 547 [2019-10-03 02:50:25,745 INFO L226 Difference]: Without dead ends: 547 [2019-10-03 02:50:25,746 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:25,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-10-03 02:50:25,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 546. [2019-10-03 02:50:25,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-10-03 02:50:25,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 770 transitions. [2019-10-03 02:50:25,767 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 770 transitions. Word has length 196 [2019-10-03 02:50:25,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:25,768 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 770 transitions. [2019-10-03 02:50:25,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:25,768 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 770 transitions. [2019-10-03 02:50:25,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-03 02:50:25,772 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:25,773 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:25,773 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:25,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:25,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1785624336, now seen corresponding path program 1 times [2019-10-03 02:50:25,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:25,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:25,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:25,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:25,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:25,932 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:25,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:25,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:25,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:25,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:25,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:25,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:25,935 INFO L87 Difference]: Start difference. First operand 546 states and 770 transitions. Second operand 3 states. [2019-10-03 02:50:25,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:25,963 INFO L93 Difference]: Finished difference Result 695 states and 1023 transitions. [2019-10-03 02:50:25,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:25,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-10-03 02:50:25,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:25,969 INFO L225 Difference]: With dead ends: 695 [2019-10-03 02:50:25,969 INFO L226 Difference]: Without dead ends: 695 [2019-10-03 02:50:25,970 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:25,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-10-03 02:50:26,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 694. [2019-10-03 02:50:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-10-03 02:50:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1022 transitions. [2019-10-03 02:50:26,008 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1022 transitions. Word has length 197 [2019-10-03 02:50:26,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:26,009 INFO L475 AbstractCegarLoop]: Abstraction has 694 states and 1022 transitions. [2019-10-03 02:50:26,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:26,010 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1022 transitions. [2019-10-03 02:50:26,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-03 02:50:26,016 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:26,017 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:26,017 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:26,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:26,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1999560001, now seen corresponding path program 1 times [2019-10-03 02:50:26,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:26,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:26,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:26,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:26,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:26,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:26,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:26,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:26,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:26,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:26,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:26,215 INFO L87 Difference]: Start difference. First operand 694 states and 1022 transitions. Second operand 3 states. [2019-10-03 02:50:26,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:26,245 INFO L93 Difference]: Finished difference Result 979 states and 1503 transitions. [2019-10-03 02:50:26,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:26,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-10-03 02:50:26,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:26,253 INFO L225 Difference]: With dead ends: 979 [2019-10-03 02:50:26,253 INFO L226 Difference]: Without dead ends: 979 [2019-10-03 02:50:26,254 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:26,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2019-10-03 02:50:26,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 978. [2019-10-03 02:50:26,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2019-10-03 02:50:26,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1502 transitions. [2019-10-03 02:50:26,289 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1502 transitions. Word has length 198 [2019-10-03 02:50:26,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:26,291 INFO L475 AbstractCegarLoop]: Abstraction has 978 states and 1502 transitions. [2019-10-03 02:50:26,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:26,291 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1502 transitions. [2019-10-03 02:50:26,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-03 02:50:26,298 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:26,298 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:26,298 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:26,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:26,299 INFO L82 PathProgramCache]: Analyzing trace with hash 164433568, now seen corresponding path program 1 times [2019-10-03 02:50:26,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:26,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:26,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:26,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:26,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:26,730 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:26,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:26,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 02:50:26,731 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:26,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 02:50:26,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 02:50:26,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:50:26,732 INFO L87 Difference]: Start difference. First operand 978 states and 1502 transitions. Second operand 19 states. [2019-10-03 02:50:31,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:31,093 INFO L93 Difference]: Finished difference Result 2353 states and 3609 transitions. [2019-10-03 02:50:31,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-03 02:50:31,094 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 201 [2019-10-03 02:50:31,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:31,116 INFO L225 Difference]: With dead ends: 2353 [2019-10-03 02:50:31,116 INFO L226 Difference]: Without dead ends: 2353 [2019-10-03 02:50:31,117 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-03 02:50:31,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2019-10-03 02:50:31,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2316. [2019-10-03 02:50:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2316 states. [2019-10-03 02:50:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 3563 transitions. [2019-10-03 02:50:31,215 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 3563 transitions. Word has length 201 [2019-10-03 02:50:31,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:31,216 INFO L475 AbstractCegarLoop]: Abstraction has 2316 states and 3563 transitions. [2019-10-03 02:50:31,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 02:50:31,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 3563 transitions. [2019-10-03 02:50:31,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-03 02:50:31,228 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:31,228 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:31,229 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:31,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:31,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1129710859, now seen corresponding path program 1 times [2019-10-03 02:50:31,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:31,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:31,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:31,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:31,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:31,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:31,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:50:31,456 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:31,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:50:31,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:50:31,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:50:31,458 INFO L87 Difference]: Start difference. First operand 2316 states and 3563 transitions. Second operand 9 states. [2019-10-03 02:50:31,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:31,758 INFO L93 Difference]: Finished difference Result 2370 states and 3646 transitions. [2019-10-03 02:50:31,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:50:31,759 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 202 [2019-10-03 02:50:31,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:31,780 INFO L225 Difference]: With dead ends: 2370 [2019-10-03 02:50:31,780 INFO L226 Difference]: Without dead ends: 2362 [2019-10-03 02:50:31,781 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:50:31,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-10-03 02:50:31,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2362. [2019-10-03 02:50:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2362 states. [2019-10-03 02:50:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 3636 transitions. [2019-10-03 02:50:31,894 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 3636 transitions. Word has length 202 [2019-10-03 02:50:31,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:31,895 INFO L475 AbstractCegarLoop]: Abstraction has 2362 states and 3636 transitions. [2019-10-03 02:50:31,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:50:31,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 3636 transitions. [2019-10-03 02:50:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-03 02:50:31,909 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:31,910 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:31,910 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:31,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:31,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1961451491, now seen corresponding path program 1 times [2019-10-03 02:50:31,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:31,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:31,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:31,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:31,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:32,186 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-03 02:50:32,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:32,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-03 02:50:32,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:32,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 02:50:32,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 02:50:32,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:50:32,188 INFO L87 Difference]: Start difference. First operand 2362 states and 3636 transitions. Second operand 14 states. [2019-10-03 02:50:32,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:32,454 INFO L93 Difference]: Finished difference Result 2418 states and 3702 transitions. [2019-10-03 02:50:32,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:50:32,455 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 202 [2019-10-03 02:50:32,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:32,474 INFO L225 Difference]: With dead ends: 2418 [2019-10-03 02:50:32,475 INFO L226 Difference]: Without dead ends: 2394 [2019-10-03 02:50:32,475 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:50:32,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2019-10-03 02:50:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2394. [2019-10-03 02:50:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2394 states. [2019-10-03 02:50:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 3668 transitions. [2019-10-03 02:50:32,589 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 3668 transitions. Word has length 202 [2019-10-03 02:50:32,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:32,590 INFO L475 AbstractCegarLoop]: Abstraction has 2394 states and 3668 transitions. [2019-10-03 02:50:32,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 02:50:32,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 3668 transitions. [2019-10-03 02:50:32,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-03 02:50:32,602 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:32,602 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:32,603 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:32,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:32,603 INFO L82 PathProgramCache]: Analyzing trace with hash 193335460, now seen corresponding path program 1 times [2019-10-03 02:50:32,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:32,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:32,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:32,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:32,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:32,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:32,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:50:32,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:32,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:50:32,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:50:32,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:50:32,882 INFO L87 Difference]: Start difference. First operand 2394 states and 3668 transitions. Second operand 15 states. [2019-10-03 02:50:36,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:36,154 INFO L93 Difference]: Finished difference Result 2478 states and 3787 transitions. [2019-10-03 02:50:36,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-03 02:50:36,155 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 202 [2019-10-03 02:50:36,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:36,171 INFO L225 Difference]: With dead ends: 2478 [2019-10-03 02:50:36,171 INFO L226 Difference]: Without dead ends: 2478 [2019-10-03 02:50:36,172 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-03 02:50:36,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2019-10-03 02:50:36,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2423. [2019-10-03 02:50:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-10-03 02:50:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 3711 transitions. [2019-10-03 02:50:36,259 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 3711 transitions. Word has length 202 [2019-10-03 02:50:36,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:36,259 INFO L475 AbstractCegarLoop]: Abstraction has 2423 states and 3711 transitions. [2019-10-03 02:50:36,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:50:36,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 3711 transitions. [2019-10-03 02:50:36,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-03 02:50:36,270 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:36,271 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:36,271 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:36,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:36,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1971016039, now seen corresponding path program 1 times [2019-10-03 02:50:36,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:36,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:36,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:36,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:36,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:36,418 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:36,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:36,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:50:36,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:36,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:50:36,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:50:36,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:50:36,420 INFO L87 Difference]: Start difference. First operand 2423 states and 3711 transitions. Second operand 5 states. [2019-10-03 02:50:37,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:37,284 INFO L93 Difference]: Finished difference Result 4424 states and 6697 transitions. [2019-10-03 02:50:37,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:50:37,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 202 [2019-10-03 02:50:37,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:37,316 INFO L225 Difference]: With dead ends: 4424 [2019-10-03 02:50:37,317 INFO L226 Difference]: Without dead ends: 4396 [2019-10-03 02:50:37,317 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:50:37,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4396 states. [2019-10-03 02:50:37,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4396 to 4365. [2019-10-03 02:50:37,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4365 states. [2019-10-03 02:50:37,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4365 states to 4365 states and 6623 transitions. [2019-10-03 02:50:37,482 INFO L78 Accepts]: Start accepts. Automaton has 4365 states and 6623 transitions. Word has length 202 [2019-10-03 02:50:37,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:37,482 INFO L475 AbstractCegarLoop]: Abstraction has 4365 states and 6623 transitions. [2019-10-03 02:50:37,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:50:37,483 INFO L276 IsEmpty]: Start isEmpty. Operand 4365 states and 6623 transitions. [2019-10-03 02:50:37,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-03 02:50:37,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:37,501 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:37,501 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:37,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:37,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1840275930, now seen corresponding path program 1 times [2019-10-03 02:50:37,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:37,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:37,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:37,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:37,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:37,850 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:37,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:37,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:50:37,851 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:37,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:50:37,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:50:37,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:50:37,852 INFO L87 Difference]: Start difference. First operand 4365 states and 6623 transitions. Second operand 7 states. [2019-10-03 02:50:39,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:39,519 INFO L93 Difference]: Finished difference Result 8499 states and 12224 transitions. [2019-10-03 02:50:39,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:50:39,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 202 [2019-10-03 02:50:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:39,589 INFO L225 Difference]: With dead ends: 8499 [2019-10-03 02:50:39,589 INFO L226 Difference]: Without dead ends: 8499 [2019-10-03 02:50:39,590 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:50:39,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8499 states. [2019-10-03 02:50:39,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8499 to 8461. [2019-10-03 02:50:39,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-10-03 02:50:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 12143 transitions. [2019-10-03 02:50:39,942 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 12143 transitions. Word has length 202 [2019-10-03 02:50:39,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:39,943 INFO L475 AbstractCegarLoop]: Abstraction has 8461 states and 12143 transitions. [2019-10-03 02:50:39,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:50:39,943 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 12143 transitions. [2019-10-03 02:50:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-03 02:50:39,966 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:39,966 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:39,967 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:39,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:39,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1975708119, now seen corresponding path program 1 times [2019-10-03 02:50:39,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:39,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:39,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:39,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:39,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:40,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:40,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-03 02:50:40,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:40,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-03 02:50:40,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-03 02:50:40,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-10-03 02:50:40,562 INFO L87 Difference]: Start difference. First operand 8461 states and 12143 transitions. Second operand 24 states. [2019-10-03 02:50:41,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:41,366 INFO L93 Difference]: Finished difference Result 9306 states and 13336 transitions. [2019-10-03 02:50:41,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-03 02:50:41,367 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 203 [2019-10-03 02:50:41,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:41,417 INFO L225 Difference]: With dead ends: 9306 [2019-10-03 02:50:41,417 INFO L226 Difference]: Without dead ends: 8814 [2019-10-03 02:50:41,418 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-10-03 02:50:41,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8814 states. [2019-10-03 02:50:41,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8814 to 8591. [2019-10-03 02:50:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8591 states. [2019-10-03 02:50:41,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8591 states to 8591 states and 12329 transitions. [2019-10-03 02:50:41,712 INFO L78 Accepts]: Start accepts. Automaton has 8591 states and 12329 transitions. Word has length 203 [2019-10-03 02:50:41,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:41,713 INFO L475 AbstractCegarLoop]: Abstraction has 8591 states and 12329 transitions. [2019-10-03 02:50:41,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-03 02:50:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand 8591 states and 12329 transitions. [2019-10-03 02:50:41,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-03 02:50:41,732 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:41,732 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:41,733 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:41,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:41,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1635585549, now seen corresponding path program 1 times [2019-10-03 02:50:41,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:41,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:41,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:41,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:41,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:41,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:41,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:50:41,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:41,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:50:41,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:50:41,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:50:41,935 INFO L87 Difference]: Start difference. First operand 8591 states and 12329 transitions. Second operand 10 states. [2019-10-03 02:50:42,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:42,022 INFO L93 Difference]: Finished difference Result 8653 states and 12381 transitions. [2019-10-03 02:50:42,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:50:42,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 207 [2019-10-03 02:50:42,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:42,058 INFO L225 Difference]: With dead ends: 8653 [2019-10-03 02:50:42,058 INFO L226 Difference]: Without dead ends: 8442 [2019-10-03 02:50:42,060 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:50:42,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8442 states. [2019-10-03 02:50:42,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8442 to 8438. [2019-10-03 02:50:42,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8438 states. [2019-10-03 02:50:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8438 states to 8438 states and 12096 transitions. [2019-10-03 02:50:42,326 INFO L78 Accepts]: Start accepts. Automaton has 8438 states and 12096 transitions. Word has length 207 [2019-10-03 02:50:42,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:42,326 INFO L475 AbstractCegarLoop]: Abstraction has 8438 states and 12096 transitions. [2019-10-03 02:50:42,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:50:42,327 INFO L276 IsEmpty]: Start isEmpty. Operand 8438 states and 12096 transitions. [2019-10-03 02:50:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-03 02:50:42,348 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:42,349 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:42,349 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:42,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:42,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1032859762, now seen corresponding path program 1 times [2019-10-03 02:50:42,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:42,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:42,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:42,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:42,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:42,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:42,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:50:42,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:42,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:50:42,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:50:42,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:50:42,637 INFO L87 Difference]: Start difference. First operand 8438 states and 12096 transitions. Second operand 5 states. [2019-10-03 02:50:42,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:42,700 INFO L93 Difference]: Finished difference Result 8621 states and 12288 transitions. [2019-10-03 02:50:42,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:50:42,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-10-03 02:50:42,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:42,735 INFO L225 Difference]: With dead ends: 8621 [2019-10-03 02:50:42,735 INFO L226 Difference]: Without dead ends: 8621 [2019-10-03 02:50:42,737 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:50:42,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8621 states. [2019-10-03 02:50:42,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8621 to 8516. [2019-10-03 02:50:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8516 states. [2019-10-03 02:50:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8516 states to 8516 states and 12137 transitions. [2019-10-03 02:50:42,994 INFO L78 Accepts]: Start accepts. Automaton has 8516 states and 12137 transitions. Word has length 212 [2019-10-03 02:50:42,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:42,995 INFO L475 AbstractCegarLoop]: Abstraction has 8516 states and 12137 transitions. [2019-10-03 02:50:42,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:50:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 8516 states and 12137 transitions. [2019-10-03 02:50:43,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-03 02:50:43,016 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:43,016 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:43,016 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:43,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:43,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1398950784, now seen corresponding path program 1 times [2019-10-03 02:50:43,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:43,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:43,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:43,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:43,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:43,161 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:43,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:43,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:50:43,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:43,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:50:43,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:50:43,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:50:43,165 INFO L87 Difference]: Start difference. First operand 8516 states and 12137 transitions. Second operand 5 states. [2019-10-03 02:50:43,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:43,226 INFO L93 Difference]: Finished difference Result 7181 states and 10340 transitions. [2019-10-03 02:50:43,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:50:43,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 214 [2019-10-03 02:50:43,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:43,253 INFO L225 Difference]: With dead ends: 7181 [2019-10-03 02:50:43,253 INFO L226 Difference]: Without dead ends: 7178 [2019-10-03 02:50:43,253 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:50:43,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7178 states. [2019-10-03 02:50:43,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7178 to 7168. [2019-10-03 02:50:43,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7168 states. [2019-10-03 02:50:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7168 states to 7168 states and 10326 transitions. [2019-10-03 02:50:43,462 INFO L78 Accepts]: Start accepts. Automaton has 7168 states and 10326 transitions. Word has length 214 [2019-10-03 02:50:43,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:43,463 INFO L475 AbstractCegarLoop]: Abstraction has 7168 states and 10326 transitions. [2019-10-03 02:50:43,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:50:43,463 INFO L276 IsEmpty]: Start isEmpty. Operand 7168 states and 10326 transitions. [2019-10-03 02:50:43,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-03 02:50:43,482 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:43,482 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:43,483 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:43,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:43,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1647701080, now seen corresponding path program 1 times [2019-10-03 02:50:43,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:43,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:43,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:43,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:43,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:43,676 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:43,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:43,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:50:43,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:43,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:50:43,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:50:43,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:50:43,679 INFO L87 Difference]: Start difference. First operand 7168 states and 10326 transitions. Second operand 6 states. [2019-10-03 02:50:44,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:44,314 INFO L93 Difference]: Finished difference Result 14369 states and 21014 transitions. [2019-10-03 02:50:44,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:50:44,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 213 [2019-10-03 02:50:44,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:44,374 INFO L225 Difference]: With dead ends: 14369 [2019-10-03 02:50:44,375 INFO L226 Difference]: Without dead ends: 14369 [2019-10-03 02:50:44,375 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:50:44,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14369 states. [2019-10-03 02:50:44,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14369 to 14191. [2019-10-03 02:50:44,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14191 states. [2019-10-03 02:50:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14191 states to 14191 states and 20810 transitions. [2019-10-03 02:50:44,883 INFO L78 Accepts]: Start accepts. Automaton has 14191 states and 20810 transitions. Word has length 213 [2019-10-03 02:50:44,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:44,884 INFO L475 AbstractCegarLoop]: Abstraction has 14191 states and 20810 transitions. [2019-10-03 02:50:44,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:50:44,884 INFO L276 IsEmpty]: Start isEmpty. Operand 14191 states and 20810 transitions. [2019-10-03 02:50:44,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-03 02:50:44,923 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:44,924 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:44,924 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:44,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:44,925 INFO L82 PathProgramCache]: Analyzing trace with hash 200978423, now seen corresponding path program 1 times [2019-10-03 02:50:44,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:44,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:44,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:44,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:44,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:50:45,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:45,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:50:45,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:45,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:50:45,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:50:45,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:50:45,165 INFO L87 Difference]: Start difference. First operand 14191 states and 20810 transitions. Second operand 8 states. [2019-10-03 02:50:49,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:49,317 INFO L93 Difference]: Finished difference Result 29061 states and 46257 transitions. [2019-10-03 02:50:49,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:50:49,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 249 [2019-10-03 02:50:49,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:49,494 INFO L225 Difference]: With dead ends: 29061 [2019-10-03 02:50:49,494 INFO L226 Difference]: Without dead ends: 29061 [2019-10-03 02:50:49,495 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:50:49,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29061 states. [2019-10-03 02:50:51,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29061 to 26447. [2019-10-03 02:50:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26447 states. [2019-10-03 02:50:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26447 states to 26447 states and 41664 transitions. [2019-10-03 02:50:51,773 INFO L78 Accepts]: Start accepts. Automaton has 26447 states and 41664 transitions. Word has length 249 [2019-10-03 02:50:51,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:51,773 INFO L475 AbstractCegarLoop]: Abstraction has 26447 states and 41664 transitions. [2019-10-03 02:50:51,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:50:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 26447 states and 41664 transitions. [2019-10-03 02:50:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-03 02:50:51,858 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:51,859 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:51,859 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:51,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:51,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1837657716, now seen corresponding path program 1 times [2019-10-03 02:50:51,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:51,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:51,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:51,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:51,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:52,091 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:50:52,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:52,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:50:52,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:52,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:50:52,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:50:52,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:50:52,096 INFO L87 Difference]: Start difference. First operand 26447 states and 41664 transitions. Second operand 8 states. [2019-10-03 02:50:56,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:56,191 INFO L93 Difference]: Finished difference Result 54377 states and 92843 transitions. [2019-10-03 02:50:56,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:50:56,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 250 [2019-10-03 02:50:56,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:56,496 INFO L225 Difference]: With dead ends: 54377 [2019-10-03 02:50:56,496 INFO L226 Difference]: Without dead ends: 54377 [2019-10-03 02:50:56,498 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:50:56,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54377 states. [2019-10-03 02:50:59,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54377 to 50760. [2019-10-03 02:50:59,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50760 states. [2019-10-03 02:50:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50760 states to 50760 states and 85491 transitions. [2019-10-03 02:50:59,685 INFO L78 Accepts]: Start accepts. Automaton has 50760 states and 85491 transitions. Word has length 250 [2019-10-03 02:50:59,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:59,686 INFO L475 AbstractCegarLoop]: Abstraction has 50760 states and 85491 transitions. [2019-10-03 02:50:59,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:50:59,686 INFO L276 IsEmpty]: Start isEmpty. Operand 50760 states and 85491 transitions. [2019-10-03 02:50:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-03 02:50:59,817 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:59,817 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:59,818 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:59,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:59,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1174403995, now seen corresponding path program 1 times [2019-10-03 02:50:59,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:59,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:59,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:59,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:59,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:51:00,038 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:51:00,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:51:00,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:51:00,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:51:00,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:51:00,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:51:00,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:51:00,040 INFO L87 Difference]: Start difference. First operand 50760 states and 85491 transitions. Second operand 8 states. [2019-10-03 02:51:04,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:51:04,611 INFO L93 Difference]: Finished difference Result 104479 states and 190187 transitions. [2019-10-03 02:51:04,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:51:04,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 251 [2019-10-03 02:51:04,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:51:05,257 INFO L225 Difference]: With dead ends: 104479 [2019-10-03 02:51:05,257 INFO L226 Difference]: Without dead ends: 104479 [2019-10-03 02:51:05,258 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:51:05,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104479 states. [2019-10-03 02:51:10,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104479 to 88326. [2019-10-03 02:51:10,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88326 states. [2019-10-03 02:51:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88326 states to 88326 states and 163430 transitions. [2019-10-03 02:51:10,511 INFO L78 Accepts]: Start accepts. Automaton has 88326 states and 163430 transitions. Word has length 251 [2019-10-03 02:51:10,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:51:10,511 INFO L475 AbstractCegarLoop]: Abstraction has 88326 states and 163430 transitions. [2019-10-03 02:51:10,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:51:10,511 INFO L276 IsEmpty]: Start isEmpty. Operand 88326 states and 163430 transitions. [2019-10-03 02:51:10,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-03 02:51:10,747 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:51:10,747 INFO L411 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] [2019-10-03 02:51:10,747 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:51:10,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:51:10,748 INFO L82 PathProgramCache]: Analyzing trace with hash -597043004, now seen corresponding path program 1 times [2019-10-03 02:51:10,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:51:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:10,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:51:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:10,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:51:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:51:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:51:10,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:51:10,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:51:10,910 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2019-10-03 02:51:10,914 INFO L207 CegarAbsIntRunner]: [72], [75], [85], [110], [126], [129], [138], [139], [142], [143], [144], [146], [228], [231], [237], [256], [258], [262], [265], [266], [267], [270], [276], [300], [302], [303], [306], [315], [326], [328], [331], [335], [336], [338], [339], [342], [352], [353], [354], [355], [357], [362], [393], [394], [397], [406], [578], [580], [581], [582], [618], [621], [635], [674], [676], [679], [680], [681], [684], [690], [714], [718], [721], [729], [732], [743], [765], [767], [770], [772], [775], [777], [779], [782], [798], [807], [811], [813], [815], [818], [825], [832], [835], [837], [971], [974], [988], [1096], [1150], [1152], [1154], [1161], [1183], [1194], [1197], [1200], [1206], [1209], [1210], [1213], [1217], [1221], [1247], [1248], [1250], [1319], [1322], [1328], [1329], [1332], [1342], [1363], [1366], [1380], [1388], [1391], [1400], [1589], [1591], [1593], [1595], [1596], [1618], [1628], [1629], [1630], [1631], [1632], [1633], [1636], [1637], [1638], [1639], [1640], [1642], [1643], [1644], [1645], [1652], [1653], [1658], [1659], [1662], [1663], [1664], [1665], [1666], [1672], [1673], [1690], [1691], [1704], [1705], [1706], [1708], [1709], [1710], [1711], [1712], [1713], [1714], [1715], [1716], [1718], [1719], [1720], [1721], [1730], [1738], [1739], [1740], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1756], [1757], [1772], [1774], [1775], [1776], [1777], [1782], [1784], [1785], [1786], [1787], [1788], [1790], [1791], [1792], [1793], [1794], [1795], [1796], [1810], [1811], [1812], [1813], [1814], [1815], [1816], [1817], [1818] [2019-10-03 02:51:10,996 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:51:10,996 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:51:11,165 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:51:11,167 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 219 root evaluator evaluations with a maximum evaluation depth of 0. Performed 219 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 360 variables. [2019-10-03 02:51:11,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:51:11,172 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:51:11,286 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:51:11,286 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:51:11,291 INFO L420 sIntCurrentIteration]: We unified 231 AI predicates to 231 [2019-10-03 02:51:11,291 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:51:11,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:51:11,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-10-03 02:51:11,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:51:11,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:51:11,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:51:11,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:51:11,297 INFO L87 Difference]: Start difference. First operand 88326 states and 163430 transitions. Second operand 2 states. [2019-10-03 02:51:11,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:51:11,298 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:51:11,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:51:11,298 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 232 [2019-10-03 02:51:11,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:51:11,298 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:51:11,298 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:51:11,299 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:51:11,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:51:11,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:51:11,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:51:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:51:11,301 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 232 [2019-10-03 02:51:11,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:51:11,301 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:51:11,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:51:11,301 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:51:11,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:51:11,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:51:11 BoogieIcfgContainer [2019-10-03 02:51:11,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:51:11,307 INFO L168 Benchmark]: Toolchain (without parser) took 51133.10 ms. Allocated memory was 133.2 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 85.2 MB in the beginning and 761.3 MB in the end (delta: -676.1 MB). Peak memory consumption was 920.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:51:11,308 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory is still 105.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-03 02:51:11,309 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1152.96 ms. Allocated memory was 133.2 MB in the beginning and 201.9 MB in the end (delta: 68.7 MB). Free memory was 85.2 MB in the beginning and 136.2 MB in the end (delta: -51.0 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:51:11,310 INFO L168 Benchmark]: Boogie Preprocessor took 189.40 ms. Allocated memory is still 201.9 MB. Free memory was 136.2 MB in the beginning and 127.5 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:51:11,311 INFO L168 Benchmark]: RCFGBuilder took 2214.96 ms. Allocated memory was 201.9 MB in the beginning and 264.2 MB in the end (delta: 62.4 MB). Free memory was 127.5 MB in the beginning and 176.8 MB in the end (delta: -49.2 MB). Peak memory consumption was 87.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:51:11,312 INFO L168 Benchmark]: TraceAbstraction took 47571.53 ms. Allocated memory was 264.2 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 176.8 MB in the beginning and 761.3 MB in the end (delta: -584.5 MB). Peak memory consumption was 880.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:51:11,316 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.22 ms. Allocated memory is still 133.2 MB. Free memory is still 105.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1152.96 ms. Allocated memory was 133.2 MB in the beginning and 201.9 MB in the end (delta: 68.7 MB). Free memory was 85.2 MB in the beginning and 136.2 MB in the end (delta: -51.0 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 189.40 ms. Allocated memory is still 201.9 MB. Free memory was 136.2 MB in the beginning and 127.5 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2214.96 ms. Allocated memory was 201.9 MB in the beginning and 264.2 MB in the end (delta: 62.4 MB). Free memory was 127.5 MB in the beginning and 176.8 MB in the end (delta: -49.2 MB). Peak memory consumption was 87.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47571.53 ms. Allocated memory was 264.2 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 176.8 MB in the beginning and 761.3 MB in the end (delta: -584.5 MB). Peak memory consumption was 880.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2079]: 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 109 procedures, 738 locations, 1 error locations. SAFE Result, 47.5s OverallTime, 21 OverallIterations, 3 TraceHistogramMax, 27.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13171 SDtfs, 9381 SDslu, 63897 SDs, 0 SdLazy, 17569 SolverSat, 2260 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 563 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88326occurred in iteration=20, 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.0043290043290045 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 13.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 23070 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 4397 NumberOfCodeBlocks, 4397 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 4376 ConstructedInterpolants, 0 QuantifiedInterpolants, 1210344 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 20 PerfectInterpolantSequences, 736/738 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...