java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec6_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:53:45,695 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:53:45,697 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:53:45,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:53:45,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:53:45,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:53:45,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:53:45,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:53:45,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:53:45,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:53:45,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:53:45,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:53:45,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:53:45,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:53:45,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:53:45,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:53:45,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:53:45,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:53:45,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:53:45,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:53:45,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:53:45,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:53:45,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:53:45,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:53:45,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:53:45,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:53:45,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:53:45,740 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:53:45,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:53:45,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:53:45,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:53:45,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:53:45,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:53:45,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:53:45,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:53:45,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:53:45,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:53:45,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:53:45,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:53:45,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:53:45,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:53:45,758 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:53:45,785 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:53:45,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:53:45,787 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:53:45,787 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:53:45,788 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:53:45,788 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:53:45,788 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:53:45,788 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:53:45,789 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:53:45,789 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:53:45,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:53:45,791 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:53:45,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:53:45,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:53:45,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:53:45,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:53:45,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:53:45,793 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:53:45,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:53:45,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:53:45,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:53:45,794 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:53:45,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:53:45,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:53:45,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:53:45,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:53:45,794 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:53:45,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:53:45,795 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:53:45,795 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:53:45,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:53:45,845 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:53:45,849 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:53:45,851 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:53:45,851 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:53:45,852 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec6_product26.cil.c [2019-10-03 02:53:45,914 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ce929760/1a8674fe773e4779be55291cb7d6aa1b/FLAG80e68dd52 [2019-10-03 02:53:46,578 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:53:46,578 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec6_product26.cil.c [2019-10-03 02:53:46,616 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ce929760/1a8674fe773e4779be55291cb7d6aa1b/FLAG80e68dd52 [2019-10-03 02:53:46,774 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ce929760/1a8674fe773e4779be55291cb7d6aa1b [2019-10-03 02:53:46,783 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:53:46,784 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:53:46,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:53:46,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:53:46,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:53:46,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:53:46" (1/1) ... [2019-10-03 02:53:46,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@690905fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:46, skipping insertion in model container [2019-10-03 02:53:46,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:53:46" (1/1) ... [2019-10-03 02:53:46,801 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:53:46,893 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:53:47,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:53:47,713 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:53:47,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:53:47,955 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:53:47,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:47 WrapperNode [2019-10-03 02:53:47,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:53:47,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:53:47,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:53:47,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:53:47,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:47" (1/1) ... [2019-10-03 02:53:47,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:47" (1/1) ... [2019-10-03 02:53:48,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:47" (1/1) ... [2019-10-03 02:53:48,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:47" (1/1) ... [2019-10-03 02:53:48,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:47" (1/1) ... [2019-10-03 02:53:48,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:47" (1/1) ... [2019-10-03 02:53:48,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:47" (1/1) ... [2019-10-03 02:53:48,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:53:48,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:53:48,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:53:48,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:53:48,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:47" (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:53:48,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:53:48,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:53:48,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:53:48,263 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:53:48,263 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:53:48,263 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:53:48,263 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:53:48,263 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:53:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:53:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-03 02:53:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:53:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-03 02:53:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:53:48,265 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-03 02:53:48,265 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:53:48,265 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:53:48,265 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:53:48,265 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:53:48,266 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:53:48,266 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:53:48,266 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:53:48,266 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:53:48,266 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:53:48,267 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:53:48,267 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:53:48,267 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:53:48,267 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:53:48,267 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:53:48,267 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-03 02:53:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-03 02:53:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-03 02:53:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:53:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:53:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:53:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:53:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:53:48,269 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:53:48,269 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:53:48,269 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:53:48,269 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:53:48,269 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:53:48,269 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:53:48,270 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:53:48,270 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:53:48,270 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:53:48,270 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:53:48,270 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:53:48,270 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:53:48,270 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:53:48,271 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:53:48,271 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:53:48,271 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:53:48,271 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:53:48,271 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:53:48,271 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:53:48,272 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:53:48,272 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:53:48,272 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:53:48,272 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:53:48,272 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:53:48,273 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:53:48,273 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:53:48,273 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:53:48,273 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:53:48,273 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:53:48,274 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:53:48,274 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:53:48,274 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:53:48,274 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:53:48,275 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:53:48,275 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:53:48,275 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:53:48,275 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:53:48,275 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:53:48,275 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:53:48,275 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:53:48,276 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:53:48,276 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:53:48,276 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:53:48,276 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:53:48,277 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:53:48,277 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:53:48,277 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:53:48,277 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:53:48,277 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:53:48,277 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-10-03 02:53:48,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-10-03 02:53:48,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:53:48,278 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:53:48,278 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:53:48,278 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-03 02:53:48,278 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:53:48,279 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-03 02:53:48,279 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:53:48,279 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:53:48,279 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:53:48,279 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:53:48,279 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-03 02:53:48,280 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:53:48,280 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:53:48,280 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:53:48,280 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-03 02:53:48,280 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-03 02:53:48,281 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-03 02:53:48,281 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:53:48,281 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:53:48,281 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:53:48,282 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:53:48,282 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:53:48,282 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:53:48,282 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:53:48,282 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:53:48,282 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:53:48,283 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-03 02:53:48,283 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-03 02:53:48,283 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-03 02:53:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:53:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:53:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:53:48,284 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:53:48,284 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:53:48,284 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:53:48,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:53:48,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:53:48,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:53:48,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:53:48,285 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:53:48,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:53:48,285 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:53:48,285 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:53:48,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:53:48,286 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:53:48,286 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:53:48,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:53:48,286 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:53:48,286 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:53:48,287 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:53:48,287 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:53:48,287 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:53:48,287 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:53:48,287 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:53:48,287 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:53:48,287 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:53:48,288 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:53:48,288 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:53:48,288 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:53:48,288 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:53:48,288 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:53:48,288 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:53:48,289 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:53:48,289 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:53:48,289 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:53:48,289 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:53:48,290 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:53:48,290 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:53:48,290 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:53:48,290 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:53:48,290 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:53:48,291 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:53:48,291 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:53:48,291 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:53:48,291 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:53:48,291 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:53:48,291 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:53:48,292 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:53:48,292 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:53:48,292 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:53:48,292 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:53:48,292 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:53:48,292 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:53:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:53:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:53:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:53:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:53:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:53:48,294 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-03 02:53:48,294 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-03 02:53:48,294 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-03 02:53:48,294 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-03 02:53:48,294 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-03 02:53:48,294 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-03 02:53:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:53:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:53:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:53:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:53:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:53:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:53:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:53:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:53:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:53:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:53:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:53:48,297 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:53:48,297 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:53:48,297 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:53:48,297 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:53:48,297 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:53:48,297 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:53:48,298 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:53:48,298 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:53:48,298 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:53:48,298 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:53:48,298 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:53:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:53:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:53:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:53:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:53:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:53:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:53:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:53:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:53:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:53:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:53:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:53:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:53:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:53:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:53:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:53:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:53:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:53:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:53:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:53:48,303 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-10-03 02:53:48,303 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-10-03 02:53:48,303 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:53:48,303 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:53:48,304 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:53:48,304 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:53:48,304 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:53:48,304 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-03 02:53:48,304 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-03 02:53:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:53:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:53:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:53:48,305 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:53:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:53:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-03 02:53:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-03 02:53:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-03 02:53:48,306 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-03 02:53:48,307 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:53:48,307 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-03 02:53:48,307 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-03 02:53:48,307 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-03 02:53:48,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:53:48,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:53:48,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:53:50,695 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:53:50,696 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:53:50,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:53:50 BoogieIcfgContainer [2019-10-03 02:53:50,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:53:50,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:53:50,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:53:50,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:53:50,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:53:46" (1/3) ... [2019-10-03 02:53:50,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2844a6f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:53:50, skipping insertion in model container [2019-10-03 02:53:50,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:47" (2/3) ... [2019-10-03 02:53:50,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2844a6f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:53:50, skipping insertion in model container [2019-10-03 02:53:50,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:53:50" (3/3) ... [2019-10-03 02:53:50,710 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec6_product26.cil.c [2019-10-03 02:53:50,721 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:53:50,735 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:53:50,753 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:53:50,788 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:53:50,788 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:53:50,789 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:53:50,789 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:53:50,793 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:53:50,793 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:53:50,793 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:53:50,794 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:53:50,843 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states. [2019-10-03 02:53:50,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-03 02:53:50,891 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:50,895 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:53:50,899 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:50,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:50,906 INFO L82 PathProgramCache]: Analyzing trace with hash 430115854, now seen corresponding path program 1 times [2019-10-03 02:53:50,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:50,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:50,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:50,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:50,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:51,733 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:53:51,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:51,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:53:51,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:51,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:53:51,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:53:51,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:53:51,762 INFO L87 Difference]: Start difference. First operand 609 states. Second operand 2 states. [2019-10-03 02:53:51,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:51,857 INFO L93 Difference]: Finished difference Result 589 states and 801 transitions. [2019-10-03 02:53:51,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:53:51,858 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 185 [2019-10-03 02:53:51,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:51,896 INFO L225 Difference]: With dead ends: 589 [2019-10-03 02:53:51,897 INFO L226 Difference]: Without dead ends: 580 [2019-10-03 02:53:51,900 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:53:51,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-10-03 02:53:52,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-10-03 02:53:52,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-03 02:53:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 790 transitions. [2019-10-03 02:53:52,018 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 790 transitions. Word has length 185 [2019-10-03 02:53:52,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:52,021 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 790 transitions. [2019-10-03 02:53:52,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:53:52,021 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 790 transitions. [2019-10-03 02:53:52,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-03 02:53:52,026 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:52,026 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] [2019-10-03 02:53:52,026 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:52,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:52,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1045148671, now seen corresponding path program 1 times [2019-10-03 02:53:52,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:52,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:52,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:52,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:52,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:52,238 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:53:52,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:52,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:53:52,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:52,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:53:52,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:53:52,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:53:52,242 INFO L87 Difference]: Start difference. First operand 580 states and 790 transitions. Second operand 3 states. [2019-10-03 02:53:52,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:52,277 INFO L93 Difference]: Finished difference Result 583 states and 793 transitions. [2019-10-03 02:53:52,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:53:52,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-10-03 02:53:52,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:52,282 INFO L225 Difference]: With dead ends: 583 [2019-10-03 02:53:52,282 INFO L226 Difference]: Without dead ends: 583 [2019-10-03 02:53:52,283 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:53:52,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-03 02:53:52,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 582. [2019-10-03 02:53:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-03 02:53:52,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 792 transitions. [2019-10-03 02:53:52,319 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 792 transitions. Word has length 186 [2019-10-03 02:53:52,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:52,320 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 792 transitions. [2019-10-03 02:53:52,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:53:52,321 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 792 transitions. [2019-10-03 02:53:52,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-03 02:53:52,329 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:52,329 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] [2019-10-03 02:53:52,330 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:52,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:52,331 INFO L82 PathProgramCache]: Analyzing trace with hash -637450832, now seen corresponding path program 1 times [2019-10-03 02:53:52,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:52,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:52,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:52,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:52,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:52,605 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:53:52,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:52,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:53:52,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:52,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:53:52,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:53:52,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:53:52,607 INFO L87 Difference]: Start difference. First operand 582 states and 792 transitions. Second operand 3 states. [2019-10-03 02:53:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:52,632 INFO L93 Difference]: Finished difference Result 627 states and 868 transitions. [2019-10-03 02:53:52,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:53:52,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-10-03 02:53:52,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:52,637 INFO L225 Difference]: With dead ends: 627 [2019-10-03 02:53:52,638 INFO L226 Difference]: Without dead ends: 627 [2019-10-03 02:53:52,638 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:53:52,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-03 02:53:52,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 626. [2019-10-03 02:53:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-03 02:53:52,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 867 transitions. [2019-10-03 02:53:52,663 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 867 transitions. Word has length 198 [2019-10-03 02:53:52,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:52,664 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 867 transitions. [2019-10-03 02:53:52,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:53:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 867 transitions. [2019-10-03 02:53:52,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-03 02:53:52,668 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:52,669 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] [2019-10-03 02:53:52,669 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:52,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:52,670 INFO L82 PathProgramCache]: Analyzing trace with hash 785310459, now seen corresponding path program 1 times [2019-10-03 02:53:52,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:52,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:52,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:52,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:52,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:52,848 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:53:52,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:52,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:53:52,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:52,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:53:52,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:53:52,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:53:52,850 INFO L87 Difference]: Start difference. First operand 626 states and 867 transitions. Second operand 3 states. [2019-10-03 02:53:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:52,891 INFO L93 Difference]: Finished difference Result 712 states and 1012 transitions. [2019-10-03 02:53:52,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:53:52,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-10-03 02:53:52,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:52,901 INFO L225 Difference]: With dead ends: 712 [2019-10-03 02:53:52,902 INFO L226 Difference]: Without dead ends: 712 [2019-10-03 02:53:52,902 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:53:52,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-10-03 02:53:52,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 711. [2019-10-03 02:53:52,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-10-03 02:53:52,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1011 transitions. [2019-10-03 02:53:52,953 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1011 transitions. Word has length 199 [2019-10-03 02:53:52,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:52,954 INFO L475 AbstractCegarLoop]: Abstraction has 711 states and 1011 transitions. [2019-10-03 02:53:52,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:53:52,954 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1011 transitions. [2019-10-03 02:53:52,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-03 02:53:52,964 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:52,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] [2019-10-03 02:53:52,966 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:52,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:52,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1620732756, now seen corresponding path program 1 times [2019-10-03 02:53:52,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:52,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:52,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:52,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:52,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:53,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:53:53,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:53,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:53:53,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:53,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:53:53,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:53:53,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:53:53,638 INFO L87 Difference]: Start difference. First operand 711 states and 1011 transitions. Second operand 11 states. [2019-10-03 02:53:59,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:59,964 INFO L93 Difference]: Finished difference Result 2898 states and 4110 transitions. [2019-10-03 02:53:59,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-03 02:53:59,964 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 202 [2019-10-03 02:53:59,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:59,989 INFO L225 Difference]: With dead ends: 2898 [2019-10-03 02:53:59,989 INFO L226 Difference]: Without dead ends: 2898 [2019-10-03 02:53:59,990 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2019-10-03 02:53:59,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2019-10-03 02:54:00,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2877. [2019-10-03 02:54:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2877 states. [2019-10-03 02:54:00,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2877 states and 4036 transitions. [2019-10-03 02:54:00,148 INFO L78 Accepts]: Start accepts. Automaton has 2877 states and 4036 transitions. Word has length 202 [2019-10-03 02:54:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:00,150 INFO L475 AbstractCegarLoop]: Abstraction has 2877 states and 4036 transitions. [2019-10-03 02:54:00,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:54:00,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2877 states and 4036 transitions. [2019-10-03 02:54:00,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-03 02:54:00,156 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:00,156 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:54:00,157 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:00,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:00,158 INFO L82 PathProgramCache]: Analyzing trace with hash 246930665, now seen corresponding path program 1 times [2019-10-03 02:54:00,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:00,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:00,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:00,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:00,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:00,570 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:54:00,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:00,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-03 02:54:00,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:00,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-03 02:54:00,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-03 02:54:00,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-03 02:54:00,574 INFO L87 Difference]: Start difference. First operand 2877 states and 4036 transitions. Second operand 18 states. [2019-10-03 02:54:01,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:01,191 INFO L93 Difference]: Finished difference Result 2912 states and 4144 transitions. [2019-10-03 02:54:01,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-03 02:54:01,192 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 203 [2019-10-03 02:54:01,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:01,210 INFO L225 Difference]: With dead ends: 2912 [2019-10-03 02:54:01,210 INFO L226 Difference]: Without dead ends: 2894 [2019-10-03 02:54:01,211 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-10-03 02:54:01,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2019-10-03 02:54:01,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2892. [2019-10-03 02:54:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2892 states. [2019-10-03 02:54:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2892 states to 2892 states and 4041 transitions. [2019-10-03 02:54:01,313 INFO L78 Accepts]: Start accepts. Automaton has 2892 states and 4041 transitions. Word has length 203 [2019-10-03 02:54:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:01,314 INFO L475 AbstractCegarLoop]: Abstraction has 2892 states and 4041 transitions. [2019-10-03 02:54:01,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-03 02:54:01,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2892 states and 4041 transitions. [2019-10-03 02:54:01,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-03 02:54:01,319 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:01,319 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:54:01,320 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:01,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:01,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1013825460, now seen corresponding path program 1 times [2019-10-03 02:54:01,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:01,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:01,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:01,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:01,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:01,543 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:54:01,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:01,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:54:01,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:01,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:54:01,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:54:01,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:54:01,546 INFO L87 Difference]: Start difference. First operand 2892 states and 4041 transitions. Second operand 6 states. [2019-10-03 02:54:02,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:02,336 INFO L93 Difference]: Finished difference Result 5871 states and 8331 transitions. [2019-10-03 02:54:02,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:54:02,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 212 [2019-10-03 02:54:02,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:02,377 INFO L225 Difference]: With dead ends: 5871 [2019-10-03 02:54:02,377 INFO L226 Difference]: Without dead ends: 5871 [2019-10-03 02:54:02,377 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:54:02,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5871 states. [2019-10-03 02:54:02,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5871 to 5800. [2019-10-03 02:54:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5800 states. [2019-10-03 02:54:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5800 states to 5800 states and 8205 transitions. [2019-10-03 02:54:02,632 INFO L78 Accepts]: Start accepts. Automaton has 5800 states and 8205 transitions. Word has length 212 [2019-10-03 02:54:02,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:02,633 INFO L475 AbstractCegarLoop]: Abstraction has 5800 states and 8205 transitions. [2019-10-03 02:54:02,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:54:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 5800 states and 8205 transitions. [2019-10-03 02:54:02,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-03 02:54:02,643 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:02,643 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:54:02,644 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:02,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:02,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1460198811, now seen corresponding path program 1 times [2019-10-03 02:54:02,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:02,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:02,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:02,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:02,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:02,888 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:54:02,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:02,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:54:02,888 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:02,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:54:02,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:54:02,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:54:02,891 INFO L87 Difference]: Start difference. First operand 5800 states and 8205 transitions. Second operand 5 states. [2019-10-03 02:54:04,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:04,269 INFO L93 Difference]: Finished difference Result 16610 states and 23593 transitions. [2019-10-03 02:54:04,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:54:04,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 213 [2019-10-03 02:54:04,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:04,377 INFO L225 Difference]: With dead ends: 16610 [2019-10-03 02:54:04,377 INFO L226 Difference]: Without dead ends: 16610 [2019-10-03 02:54:04,378 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:54:04,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16610 states. [2019-10-03 02:54:04,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16610 to 16514. [2019-10-03 02:54:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16514 states. [2019-10-03 02:54:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16514 states to 16514 states and 23470 transitions. [2019-10-03 02:54:04,911 INFO L78 Accepts]: Start accepts. Automaton has 16514 states and 23470 transitions. Word has length 213 [2019-10-03 02:54:04,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:04,911 INFO L475 AbstractCegarLoop]: Abstraction has 16514 states and 23470 transitions. [2019-10-03 02:54:04,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:54:04,911 INFO L276 IsEmpty]: Start isEmpty. Operand 16514 states and 23470 transitions. [2019-10-03 02:54:04,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-03 02:54:04,923 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:04,924 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:54:04,924 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:04,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:04,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2046974930, now seen corresponding path program 1 times [2019-10-03 02:54:04,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:04,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:04,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:04,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:04,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:05,155 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:54:05,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:05,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:54:05,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:05,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:54:05,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:54:05,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:54:05,157 INFO L87 Difference]: Start difference. First operand 16514 states and 23470 transitions. Second operand 11 states. [2019-10-03 02:54:06,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:06,241 INFO L93 Difference]: Finished difference Result 16438 states and 23139 transitions. [2019-10-03 02:54:06,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:54:06,242 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 213 [2019-10-03 02:54:06,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:06,330 INFO L225 Difference]: With dead ends: 16438 [2019-10-03 02:54:06,331 INFO L226 Difference]: Without dead ends: 16438 [2019-10-03 02:54:06,332 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:54:06,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16438 states. [2019-10-03 02:54:06,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16438 to 16386. [2019-10-03 02:54:06,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16386 states. [2019-10-03 02:54:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16386 states to 16386 states and 23087 transitions. [2019-10-03 02:54:06,760 INFO L78 Accepts]: Start accepts. Automaton has 16386 states and 23087 transitions. Word has length 213 [2019-10-03 02:54:06,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:06,761 INFO L475 AbstractCegarLoop]: Abstraction has 16386 states and 23087 transitions. [2019-10-03 02:54:06,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:54:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 16386 states and 23087 transitions. [2019-10-03 02:54:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-03 02:54:06,780 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:06,780 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:54:06,780 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:06,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:06,781 INFO L82 PathProgramCache]: Analyzing trace with hash 975255081, now seen corresponding path program 1 times [2019-10-03 02:54:06,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:06,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:06,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:06,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:06,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:06,976 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:54:06,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:06,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:06,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:06,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:06,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:06,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:06,978 INFO L87 Difference]: Start difference. First operand 16386 states and 23087 transitions. Second operand 3 states. [2019-10-03 02:54:07,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:07,070 INFO L93 Difference]: Finished difference Result 17046 states and 24285 transitions. [2019-10-03 02:54:07,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:07,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-10-03 02:54:07,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:07,153 INFO L225 Difference]: With dead ends: 17046 [2019-10-03 02:54:07,153 INFO L226 Difference]: Without dead ends: 17046 [2019-10-03 02:54:07,153 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:54:07,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17046 states. [2019-10-03 02:54:07,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17046 to 17042. [2019-10-03 02:54:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17042 states. [2019-10-03 02:54:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17042 states to 17042 states and 24281 transitions. [2019-10-03 02:54:07,967 INFO L78 Accepts]: Start accepts. Automaton has 17042 states and 24281 transitions. Word has length 249 [2019-10-03 02:54:07,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:07,969 INFO L475 AbstractCegarLoop]: Abstraction has 17042 states and 24281 transitions. [2019-10-03 02:54:07,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:07,969 INFO L276 IsEmpty]: Start isEmpty. Operand 17042 states and 24281 transitions. [2019-10-03 02:54:07,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-03 02:54:07,989 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:07,989 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:54:07,990 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:07,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:07,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1569980340, now seen corresponding path program 1 times [2019-10-03 02:54:07,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:07,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:07,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:07,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:07,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:08,254 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:54:08,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:08,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:54:08,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:08,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:54:08,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:54:08,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:54:08,257 INFO L87 Difference]: Start difference. First operand 17042 states and 24281 transitions. Second operand 8 states. [2019-10-03 02:54:13,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:13,469 INFO L93 Difference]: Finished difference Result 34515 states and 50281 transitions. [2019-10-03 02:54:13,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:54:13,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 250 [2019-10-03 02:54:13,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:13,638 INFO L225 Difference]: With dead ends: 34515 [2019-10-03 02:54:13,638 INFO L226 Difference]: Without dead ends: 34515 [2019-10-03 02:54:13,640 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:54:13,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34515 states. [2019-10-03 02:54:15,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34515 to 19526. [2019-10-03 02:54:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19526 states. [2019-10-03 02:54:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19526 states to 19526 states and 29149 transitions. [2019-10-03 02:54:15,084 INFO L78 Accepts]: Start accepts. Automaton has 19526 states and 29149 transitions. Word has length 250 [2019-10-03 02:54:15,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:15,085 INFO L475 AbstractCegarLoop]: Abstraction has 19526 states and 29149 transitions. [2019-10-03 02:54:15,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:54:15,085 INFO L276 IsEmpty]: Start isEmpty. Operand 19526 states and 29149 transitions. [2019-10-03 02:54:15,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-03 02:54:15,125 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:15,126 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:15,126 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:15,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:15,127 INFO L82 PathProgramCache]: Analyzing trace with hash 292222328, now seen corresponding path program 1 times [2019-10-03 02:54:15,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:15,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:15,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:15,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:15,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:15,331 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:54:15,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:15,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:54:15,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:15,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:54:15,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:54:15,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:54:15,334 INFO L87 Difference]: Start difference. First operand 19526 states and 29149 transitions. Second operand 8 states. [2019-10-03 02:54:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:20,510 INFO L93 Difference]: Finished difference Result 40019 states and 61921 transitions. [2019-10-03 02:54:20,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:54:20,510 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 236 [2019-10-03 02:54:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:20,682 INFO L225 Difference]: With dead ends: 40019 [2019-10-03 02:54:20,683 INFO L226 Difference]: Without dead ends: 40019 [2019-10-03 02:54:20,683 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:54:20,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40019 states. [2019-10-03 02:54:21,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40019 to 24614. [2019-10-03 02:54:21,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24614 states. [2019-10-03 02:54:21,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24614 states to 24614 states and 39725 transitions. [2019-10-03 02:54:21,893 INFO L78 Accepts]: Start accepts. Automaton has 24614 states and 39725 transitions. Word has length 236 [2019-10-03 02:54:21,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:21,893 INFO L475 AbstractCegarLoop]: Abstraction has 24614 states and 39725 transitions. [2019-10-03 02:54:21,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:54:21,893 INFO L276 IsEmpty]: Start isEmpty. Operand 24614 states and 39725 transitions. [2019-10-03 02:54:21,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-03 02:54:21,974 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:21,974 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, 1] [2019-10-03 02:54:21,975 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:21,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:21,975 INFO L82 PathProgramCache]: Analyzing trace with hash -174648144, now seen corresponding path program 1 times [2019-10-03 02:54:21,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:21,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:21,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:21,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:21,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:22,203 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:54:22,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:22,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:54:22,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:22,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:54:22,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:54:22,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:54:22,206 INFO L87 Difference]: Start difference. First operand 24614 states and 39725 transitions. Second operand 8 states. [2019-10-03 02:54:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:29,939 INFO L93 Difference]: Finished difference Result 51179 states and 86837 transitions. [2019-10-03 02:54:29,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:54:29,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 252 [2019-10-03 02:54:29,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:30,087 INFO L225 Difference]: With dead ends: 51179 [2019-10-03 02:54:30,087 INFO L226 Difference]: Without dead ends: 51179 [2019-10-03 02:54:30,088 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:54:30,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51179 states. [2019-10-03 02:54:31,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51179 to 34918. [2019-10-03 02:54:31,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34918 states. [2019-10-03 02:54:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34918 states to 34918 states and 62417 transitions. [2019-10-03 02:54:31,112 INFO L78 Accepts]: Start accepts. Automaton has 34918 states and 62417 transitions. Word has length 252 [2019-10-03 02:54:31,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:31,113 INFO L475 AbstractCegarLoop]: Abstraction has 34918 states and 62417 transitions. [2019-10-03 02:54:31,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:54:31,113 INFO L276 IsEmpty]: Start isEmpty. Operand 34918 states and 62417 transitions. [2019-10-03 02:54:31,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-03 02:54:31,204 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:31,205 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:54:31,205 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:31,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:31,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1815241919, now seen corresponding path program 1 times [2019-10-03 02:54:31,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:31,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:31,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:31,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:31,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:31,672 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:54:31,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:31,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:31,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:31,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:31,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:31,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:31,675 INFO L87 Difference]: Start difference. First operand 34918 states and 62417 transitions. Second operand 3 states. [2019-10-03 02:54:31,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:31,961 INFO L93 Difference]: Finished difference Result 45034 states and 86485 transitions. [2019-10-03 02:54:31,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:31,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-10-03 02:54:31,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:32,118 INFO L225 Difference]: With dead ends: 45034 [2019-10-03 02:54:32,119 INFO L226 Difference]: Without dead ends: 45034 [2019-10-03 02:54:32,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:54:32,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45034 states. [2019-10-03 02:54:33,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45034 to 45030. [2019-10-03 02:54:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45030 states. [2019-10-03 02:54:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45030 states to 45030 states and 86481 transitions. [2019-10-03 02:54:33,174 INFO L78 Accepts]: Start accepts. Automaton has 45030 states and 86481 transitions. Word has length 242 [2019-10-03 02:54:33,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:33,174 INFO L475 AbstractCegarLoop]: Abstraction has 45030 states and 86481 transitions. [2019-10-03 02:54:33,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:33,174 INFO L276 IsEmpty]: Start isEmpty. Operand 45030 states and 86481 transitions. [2019-10-03 02:54:33,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-03 02:54:33,293 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:33,293 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:54:33,293 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:33,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:33,294 INFO L82 PathProgramCache]: Analyzing trace with hash 39283747, now seen corresponding path program 1 times [2019-10-03 02:54:33,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:33,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:33,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:33,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:33,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 02:54:36,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:54:36,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:54:36,616 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 259 with the following transitions: [2019-10-03 02:54:36,618 INFO L207 CegarAbsIntRunner]: [72], [75], [85], [105], [108], [109], [112], [122], [123], [139], [142], [143], [146], [155], [156], [157], [159], [255], [258], [264], [269], [271], [275], [278], [279], [280], [283], [289], [313], [315], [317], [320], [341], [344], [353], [364], [366], [367], [370], [380], [383], [385], [388], [390], [392], [423], [426], [435], [536], [539], [549], [611], [613], [614], [615], [633], [636], [650], [653], [656], [670], [699], [700], [711], [713], [715], [718], [721], [727], [741], [745], [748], [766], [769], [800], [833], [834], [843], [847], [849], [851], [854], [861], [868], [875], [882], [885], [887], [892], [896], [899], [901], [1085], [1088], [1091], [1135], [1136], [1139], [1142], [1145], [1189], [1208], [1210], [1227], [1231], [1242], [1245], [1246], [1249], [1252], [1283], [1286], [1288], [1371], [1374], [1380], [1401], [1404], [1418], [1426], [1429], [1438], [1505], [1508], [1510], [1512], [1514], [1519], [1529], [1531], [1532], [1657], [1659], [1661], [1663], [1664], [1688], [1689], [1690], [1691], [1692], [1693], [1694], [1704], [1705], [1706], [1707], [1708], [1709], [1712], [1713], [1714], [1715], [1716], [1718], [1719], [1720], [1721], [1728], [1729], [1730], [1731], [1732], [1733], [1734], [1735], [1736], [1748], [1749], [1750], [1751], [1752], [1753], [1782], [1783], [1798], [1799], [1800], [1801], [1802], [1804], [1805], [1806], [1807], [1808], [1809], [1810], [1811], [1812], [1814], [1815], [1816], [1817], [1832], [1848], [1849], [1854], [1855], [1856], [1857], [1872], [1874], [1875], [1892], [1894], [1895], [1896], [1897], [1898], [1899], [1900], [1908], [1909], [1910], [1911], [1912], [1913], [1914], [1918], [1919], [1932], [1933], [1934], [1935], [1936], [1937], [1938], [1939], [1940] [2019-10-03 02:54:36,667 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:54:36,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:54:36,773 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:54:36,775 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 198 root evaluator evaluations with a maximum evaluation depth of 0. Performed 198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 386 variables. [2019-10-03 02:54:36,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:36,778 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:54:36,854 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:54:36,854 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:54:36,861 INFO L420 sIntCurrentIteration]: We unified 257 AI predicates to 257 [2019-10-03 02:54:36,861 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:54:36,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:54:36,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [54] total 54 [2019-10-03 02:54:36,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:36,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:54:36,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:54:36,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:54:36,864 INFO L87 Difference]: Start difference. First operand 45030 states and 86481 transitions. Second operand 2 states. [2019-10-03 02:54:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:36,865 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:54:36,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:54:36,865 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 258 [2019-10-03 02:54:36,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:36,865 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:54:36,865 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:54:36,866 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 257 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:54:36,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:54:36,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:54:36,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:54:36,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:54:36,866 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 258 [2019-10-03 02:54:36,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:36,867 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:54:36,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:54:36,867 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:54:36,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:54:36,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:54:36 BoogieIcfgContainer [2019-10-03 02:54:36,872 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:54:36,875 INFO L168 Benchmark]: Toolchain (without parser) took 50089.40 ms. Allocated memory was 133.7 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 86.8 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 538.1 MB. Max. memory is 7.1 GB. [2019-10-03 02:54:36,876 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:54:36,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1171.14 ms. Allocated memory was 133.7 MB in the beginning and 201.3 MB in the end (delta: 67.6 MB). Free memory was 86.4 MB in the beginning and 129.0 MB in the end (delta: -42.6 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:54:36,877 INFO L168 Benchmark]: Boogie Preprocessor took 225.28 ms. Allocated memory is still 201.3 MB. Free memory was 129.0 MB in the beginning and 119.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:54:36,879 INFO L168 Benchmark]: RCFGBuilder took 2515.27 ms. Allocated memory was 201.3 MB in the beginning and 262.7 MB in the end (delta: 61.3 MB). Free memory was 119.1 MB in the beginning and 139.9 MB in the end (delta: -20.7 MB). Peak memory consumption was 79.1 MB. Max. memory is 7.1 GB. [2019-10-03 02:54:36,879 INFO L168 Benchmark]: TraceAbstraction took 46172.98 ms. Allocated memory was 262.7 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 139.9 MB in the beginning and 1.1 GB in the end (delta: -994.8 MB). Peak memory consumption was 462.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:54:36,884 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1171.14 ms. Allocated memory was 133.7 MB in the beginning and 201.3 MB in the end (delta: 67.6 MB). Free memory was 86.4 MB in the beginning and 129.0 MB in the end (delta: -42.6 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 225.28 ms. Allocated memory is still 201.3 MB. Free memory was 129.0 MB in the beginning and 119.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2515.27 ms. Allocated memory was 201.3 MB in the beginning and 262.7 MB in the end (delta: 61.3 MB). Free memory was 119.1 MB in the beginning and 139.9 MB in the end (delta: -20.7 MB). Peak memory consumption was 79.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46172.98 ms. Allocated memory was 262.7 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 139.9 MB in the beginning and 1.1 GB in the end (delta: -994.8 MB). Peak memory consumption was 462.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2316]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 116 procedures, 798 locations, 1 error locations. SAFE Result, 46.0s OverallTime, 15 OverallIterations, 4 TraceHistogramMax, 30.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12892 SDtfs, 11162 SDslu, 38736 SDs, 0 SdLazy, 18999 SolverSat, 3179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 453 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45030occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.9766536964980546 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 7.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 46908 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 3298 NumberOfCodeBlocks, 3298 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3283 ConstructedInterpolants, 0 QuantifiedInterpolants, 1060864 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 542/548 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...