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_product16.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:53:32,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:53:32,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:53:32,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:53:32,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:53:32,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:53:32,029 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:53:32,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:53:32,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:53:32,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:53:32,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:53:32,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:53:32,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:53:32,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:53:32,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:53:32,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:53:32,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:53:32,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:53:32,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:53:32,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:53:32,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:53:32,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:53:32,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:53:32,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:53:32,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:53:32,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:53:32,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:53:32,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:53:32,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:53:32,055 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:53:32,055 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:53:32,056 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:53:32,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:53:32,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:53:32,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:53:32,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:53:32,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:53:32,060 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:53:32,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:53:32,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:53:32,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:53:32,063 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:32,094 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:53:32,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:53:32,095 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:53:32,095 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:53:32,096 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:53:32,096 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:53:32,096 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:53:32,097 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:53:32,097 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:53:32,098 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:53:32,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:53:32,100 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:53:32,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:53:32,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:53:32,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:53:32,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:53:32,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:53:32,102 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:53:32,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:53:32,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:53:32,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:53:32,103 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:53:32,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:53:32,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:53:32,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:53:32,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:53:32,104 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:53:32,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:53:32,105 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:53:32,105 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:53:32,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:53:32,184 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:53:32,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:53:32,189 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:53:32,190 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:53:32,191 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec6_product16.cil.c [2019-10-03 02:53:32,254 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a95c45e5/d53fbdae9adf49c0ab20ef03273f3cbc/FLAG5682e023e [2019-10-03 02:53:32,892 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:53:32,894 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec6_product16.cil.c [2019-10-03 02:53:32,916 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a95c45e5/d53fbdae9adf49c0ab20ef03273f3cbc/FLAG5682e023e [2019-10-03 02:53:33,142 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a95c45e5/d53fbdae9adf49c0ab20ef03273f3cbc [2019-10-03 02:53:33,152 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:53:33,153 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:53:33,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:53:33,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:53:33,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:53:33,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:53:33" (1/1) ... [2019-10-03 02:53:33,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d32cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:33, skipping insertion in model container [2019-10-03 02:53:33,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:53:33" (1/1) ... [2019-10-03 02:53:33,170 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:53:33,251 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:53:34,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:53:34,207 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:53:34,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:53:34,461 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:53:34,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:34 WrapperNode [2019-10-03 02:53:34,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:53:34,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:53:34,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:53:34,463 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:53:34,479 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:34" (1/1) ... [2019-10-03 02:53:34,480 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:34" (1/1) ... [2019-10-03 02:53:34,524 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:34" (1/1) ... [2019-10-03 02:53:34,524 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:34" (1/1) ... [2019-10-03 02:53:34,577 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:34" (1/1) ... [2019-10-03 02:53:34,597 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:34" (1/1) ... [2019-10-03 02:53:34,607 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:34" (1/1) ... [2019-10-03 02:53:34,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:53:34,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:53:34,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:53:34,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:53:34,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:34" (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:34,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:53:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:53:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:53:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-03 02:53:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:53:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-03 02:53:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:53:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-03 02:53:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:53:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:53:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:53:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:53:34,715 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:53:34,715 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:53:34,716 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:53:34,717 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:53:34,717 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:53:34,717 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:53:34,718 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:53:34,718 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:53:34,718 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:53:34,718 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:53:34,719 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-03 02:53:34,719 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:53:34,720 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:53:34,720 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:53:34,720 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:53:34,720 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:53:34,720 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:53:34,721 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:53:34,721 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:53:34,721 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:53:34,721 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:53:34,721 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:53:34,722 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:53:34,722 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:53:34,722 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:53:34,722 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:53:34,722 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:53:34,723 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:53:34,723 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:53:34,723 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:53:34,723 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:53:34,723 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:53:34,724 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:53:34,724 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:53:34,724 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:53:34,724 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:53:34,724 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:53:34,725 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:53:34,725 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:53:34,725 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:53:34,725 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:53:34,725 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:53:34,725 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:53:34,726 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:53:34,726 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:53:34,726 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:53:34,726 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:53:34,726 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:53:34,727 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:53:34,727 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:53:34,727 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:53:34,727 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:53:34,727 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:53:34,728 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:53:34,728 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:53:34,728 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:53:34,728 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:53:34,728 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:53:34,728 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:53:34,729 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:53:34,729 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:53:34,729 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:53:34,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:53:34,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:53:34,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:53:34,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:53:34,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:53:34,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:53:34,731 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:53:34,731 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:53:34,731 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:53:34,731 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:53:34,731 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:53:34,732 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-03 02:53:34,733 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:53:34,733 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-03 02:53:34,733 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:53:34,734 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:53:34,734 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:53:34,734 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:53:34,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-10-03 02:53:34,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-10-03 02:53:34,734 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:53:34,735 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-03 02:53:34,735 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:53:34,735 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:53:34,735 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-03 02:53:34,735 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-03 02:53:34,735 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:53:34,735 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:53:34,735 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:53:34,736 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:53:34,736 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:53:34,736 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:53:34,736 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:53:34,736 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:53:34,736 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:53:34,737 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-03 02:53:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:53:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:53:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:53:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:53:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:53:34,738 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:53:34,738 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:53:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:53:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:53:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:53:34,740 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:53:34,740 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:53:34,740 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:53:34,741 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:53:34,741 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:53:34,741 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:53:34,742 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:53:34,742 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:53:34,742 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:53:34,742 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:53:34,742 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:53:34,743 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:53:34,743 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:53:34,743 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:53:34,743 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:53:34,743 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:53:34,743 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:53:34,744 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:53:34,744 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:53:34,747 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:53:34,748 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:53:34,748 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:53:34,749 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:53:34,755 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:53:34,755 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:53:34,755 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:53:34,755 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:53:34,756 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:53:34,756 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-03 02:53:34,756 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-03 02:53:34,757 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-03 02:53:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-03 02:53:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:53:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:53:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:53:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:53:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:53:34,759 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:53:34,759 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:53:34,759 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:53:34,759 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:53:34,759 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:53:34,759 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:53:34,759 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:53:34,760 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:53:34,760 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:53:34,760 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:53:34,760 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:53:34,760 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:53:34,760 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:53:34,760 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:53:34,761 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:53:34,761 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:53:34,761 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:53:34,761 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:53:34,761 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:53:34,761 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:53:34,761 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:53:34,762 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:53:34,762 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:53:34,762 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:53:34,762 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:53:34,762 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:53:34,762 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:53:34,762 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:53:34,762 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:53:34,763 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:53:34,763 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:53:34,763 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:53:34,763 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:53:34,763 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:53:34,763 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:53:34,763 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:53:34,764 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:53:34,764 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:53:34,764 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:53:34,764 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:53:34,764 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:53:34,764 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:53:34,764 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:53:34,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:53:34,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:53:34,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:53:34,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:53:34,765 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:53:34,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:53:34,765 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:53:34,765 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:53:34,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:53:34,766 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:53:34,766 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:53:34,766 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:53:34,766 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:53:34,766 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:53:34,766 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:53:34,766 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:53:34,766 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:53:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-03 02:53:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-03 02:53:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:53:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:53:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-10-03 02:53:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-10-03 02:53:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:53:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:53:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:53:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:53:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:53:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-03 02:53:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-03 02:53:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-03 02:53:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-03 02:53:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:53:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:53:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:53:37,060 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:53:37,060 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:53:37,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:53:37 BoogieIcfgContainer [2019-10-03 02:53:37,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:53:37,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:53:37,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:53:37,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:53:37,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:53:33" (1/3) ... [2019-10-03 02:53:37,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64dbbaa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:53:37, skipping insertion in model container [2019-10-03 02:53:37,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:34" (2/3) ... [2019-10-03 02:53:37,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64dbbaa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:53:37, skipping insertion in model container [2019-10-03 02:53:37,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:53:37" (3/3) ... [2019-10-03 02:53:37,072 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec6_product16.cil.c [2019-10-03 02:53:37,082 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:53:37,095 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:53:37,112 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:53:37,143 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:53:37,143 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:53:37,143 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:53:37,143 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:53:37,143 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:53:37,144 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:53:37,144 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:53:37,144 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:53:37,182 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states. [2019-10-03 02:53:37,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-03 02:53:37,218 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:37,219 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:53:37,221 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:37,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:37,227 INFO L82 PathProgramCache]: Analyzing trace with hash -610566367, now seen corresponding path program 1 times [2019-10-03 02:53:37,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:37,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:37,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:37,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:37,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:37,761 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:37,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:37,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:53:37,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:37,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:53:37,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:53:37,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:53:37,788 INFO L87 Difference]: Start difference. First operand 484 states. Second operand 2 states. [2019-10-03 02:53:37,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:37,841 INFO L93 Difference]: Finished difference Result 470 states and 622 transitions. [2019-10-03 02:53:37,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:53:37,843 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 176 [2019-10-03 02:53:37,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:37,871 INFO L225 Difference]: With dead ends: 470 [2019-10-03 02:53:37,871 INFO L226 Difference]: Without dead ends: 461 [2019-10-03 02:53:37,873 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:37,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-10-03 02:53:37,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2019-10-03 02:53:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-10-03 02:53:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 611 transitions. [2019-10-03 02:53:37,969 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 611 transitions. Word has length 176 [2019-10-03 02:53:37,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:37,972 INFO L475 AbstractCegarLoop]: Abstraction has 461 states and 611 transitions. [2019-10-03 02:53:37,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:53:37,972 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 611 transitions. [2019-10-03 02:53:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-03 02:53:37,978 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:37,978 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:53:37,978 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:37,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:37,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1997838255, now seen corresponding path program 1 times [2019-10-03 02:53:37,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:37,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:37,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:37,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:37,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:38,313 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:38,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:38,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:53:38,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:38,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:53:38,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:53:38,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:53:38,321 INFO L87 Difference]: Start difference. First operand 461 states and 611 transitions. Second operand 3 states. [2019-10-03 02:53:38,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:38,378 INFO L93 Difference]: Finished difference Result 464 states and 614 transitions. [2019-10-03 02:53:38,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:53:38,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-10-03 02:53:38,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:38,384 INFO L225 Difference]: With dead ends: 464 [2019-10-03 02:53:38,384 INFO L226 Difference]: Without dead ends: 464 [2019-10-03 02:53:38,385 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:38,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-10-03 02:53:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 463. [2019-10-03 02:53:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-10-03 02:53:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 613 transitions. [2019-10-03 02:53:38,419 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 613 transitions. Word has length 177 [2019-10-03 02:53:38,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:38,420 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 613 transitions. [2019-10-03 02:53:38,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:53:38,420 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 613 transitions. [2019-10-03 02:53:38,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-03 02:53:38,426 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:38,427 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] [2019-10-03 02:53:38,427 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:38,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:38,428 INFO L82 PathProgramCache]: Analyzing trace with hash 47308899, now seen corresponding path program 1 times [2019-10-03 02:53:38,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:38,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:38,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:38,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:38,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:38,618 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:53:38,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:38,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:53:38,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:38,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:53:38,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:53:38,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:53:38,629 INFO L87 Difference]: Start difference. First operand 463 states and 613 transitions. Second operand 3 states. [2019-10-03 02:53:38,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:38,686 INFO L93 Difference]: Finished difference Result 504 states and 683 transitions. [2019-10-03 02:53:38,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:53:38,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-10-03 02:53:38,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:38,697 INFO L225 Difference]: With dead ends: 504 [2019-10-03 02:53:38,698 INFO L226 Difference]: Without dead ends: 504 [2019-10-03 02:53:38,698 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:38,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-10-03 02:53:38,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 503. [2019-10-03 02:53:38,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-10-03 02:53:38,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 682 transitions. [2019-10-03 02:53:38,757 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 682 transitions. Word has length 183 [2019-10-03 02:53:38,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:38,758 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 682 transitions. [2019-10-03 02:53:38,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:53:38,758 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 682 transitions. [2019-10-03 02:53:38,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-03 02:53:38,770 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:38,770 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] [2019-10-03 02:53:38,771 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:38,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:38,771 INFO L82 PathProgramCache]: Analyzing trace with hash 142664055, now seen corresponding path program 1 times [2019-10-03 02:53:38,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:38,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:38,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:38,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:38,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:39,219 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:39,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:39,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:53:39,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:39,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:53:39,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:53:39,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:53:39,221 INFO L87 Difference]: Start difference. First operand 503 states and 682 transitions. Second operand 11 states. [2019-10-03 02:53:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:43,939 INFO L93 Difference]: Finished difference Result 2054 states and 2719 transitions. [2019-10-03 02:53:43,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-03 02:53:43,940 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 184 [2019-10-03 02:53:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:43,957 INFO L225 Difference]: With dead ends: 2054 [2019-10-03 02:53:43,958 INFO L226 Difference]: Without dead ends: 1788 [2019-10-03 02:53:43,960 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-10-03 02:53:43,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2019-10-03 02:53:44,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1773. [2019-10-03 02:53:44,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2019-10-03 02:53:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2323 transitions. [2019-10-03 02:53:44,054 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2323 transitions. Word has length 184 [2019-10-03 02:53:44,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:44,055 INFO L475 AbstractCegarLoop]: Abstraction has 1773 states and 2323 transitions. [2019-10-03 02:53:44,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:53:44,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2323 transitions. [2019-10-03 02:53:44,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-03 02:53:44,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:44,060 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] [2019-10-03 02:53:44,060 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:44,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:44,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1260234417, now seen corresponding path program 1 times [2019-10-03 02:53:44,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:44,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:44,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:44,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:44,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:44,438 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:44,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:44,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-03 02:53:44,439 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:44,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-03 02:53:44,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-03 02:53:44,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:53:44,441 INFO L87 Difference]: Start difference. First operand 1773 states and 2323 transitions. Second operand 16 states. [2019-10-03 02:53:44,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:44,840 INFO L93 Difference]: Finished difference Result 1731 states and 2265 transitions. [2019-10-03 02:53:44,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-03 02:53:44,841 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 185 [2019-10-03 02:53:44,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:44,850 INFO L225 Difference]: With dead ends: 1731 [2019-10-03 02:53:44,851 INFO L226 Difference]: Without dead ends: 1440 [2019-10-03 02:53:44,851 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-10-03 02:53:44,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2019-10-03 02:53:44,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1393. [2019-10-03 02:53:44,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1393 states. [2019-10-03 02:53:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1820 transitions. [2019-10-03 02:53:44,904 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1820 transitions. Word has length 185 [2019-10-03 02:53:44,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:44,906 INFO L475 AbstractCegarLoop]: Abstraction has 1393 states and 1820 transitions. [2019-10-03 02:53:44,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-03 02:53:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1820 transitions. [2019-10-03 02:53:44,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-03 02:53:44,910 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:44,910 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:53:44,911 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:44,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:44,911 INFO L82 PathProgramCache]: Analyzing trace with hash 2110369116, now seen corresponding path program 1 times [2019-10-03 02:53:44,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:44,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:44,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:44,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:44,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:45,168 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:45,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:45,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:53:45,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:45,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:53:45,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:53:45,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:53:45,170 INFO L87 Difference]: Start difference. First operand 1393 states and 1820 transitions. Second operand 6 states. [2019-10-03 02:53:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:45,813 INFO L93 Difference]: Finished difference Result 2777 states and 3640 transitions. [2019-10-03 02:53:45,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:53:45,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 194 [2019-10-03 02:53:45,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:45,830 INFO L225 Difference]: With dead ends: 2777 [2019-10-03 02:53:45,831 INFO L226 Difference]: Without dead ends: 2777 [2019-10-03 02:53:45,831 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:53:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2019-10-03 02:53:45,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2706. [2019-10-03 02:53:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2706 states. [2019-10-03 02:53:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3557 transitions. [2019-10-03 02:53:45,955 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3557 transitions. Word has length 194 [2019-10-03 02:53:45,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:45,956 INFO L475 AbstractCegarLoop]: Abstraction has 2706 states and 3557 transitions. [2019-10-03 02:53:45,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:53:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3557 transitions. [2019-10-03 02:53:45,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-03 02:53:45,964 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:45,965 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:53:45,965 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:45,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:45,966 INFO L82 PathProgramCache]: Analyzing trace with hash 589326950, now seen corresponding path program 1 times [2019-10-03 02:53:45,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:45,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:45,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:45,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:45,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:46,203 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:46,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:46,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:53:46,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:46,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:53:46,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:53:46,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:53:46,205 INFO L87 Difference]: Start difference. First operand 2706 states and 3557 transitions. Second operand 5 states. [2019-10-03 02:53:47,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:47,266 INFO L93 Difference]: Finished difference Result 7570 states and 9873 transitions. [2019-10-03 02:53:47,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:53:47,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-10-03 02:53:47,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:47,321 INFO L225 Difference]: With dead ends: 7570 [2019-10-03 02:53:47,321 INFO L226 Difference]: Without dead ends: 7570 [2019-10-03 02:53:47,322 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:53:47,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7570 states. [2019-10-03 02:53:47,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7570 to 7434. [2019-10-03 02:53:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7434 states. [2019-10-03 02:53:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7434 states to 7434 states and 9721 transitions. [2019-10-03 02:53:47,620 INFO L78 Accepts]: Start accepts. Automaton has 7434 states and 9721 transitions. Word has length 195 [2019-10-03 02:53:47,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:47,623 INFO L475 AbstractCegarLoop]: Abstraction has 7434 states and 9721 transitions. [2019-10-03 02:53:47,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:53:47,623 INFO L276 IsEmpty]: Start isEmpty. Operand 7434 states and 9721 transitions. [2019-10-03 02:53:47,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-03 02:53:47,632 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:47,632 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:53:47,632 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:47,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:47,633 INFO L82 PathProgramCache]: Analyzing trace with hash 2550831, now seen corresponding path program 1 times [2019-10-03 02:53:47,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:47,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:47,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:47,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:47,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:47,857 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:47,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:47,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:53:47,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:47,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:53:47,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:53:47,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:53:47,860 INFO L87 Difference]: Start difference. First operand 7434 states and 9721 transitions. Second operand 9 states. [2019-10-03 02:53:48,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:48,124 INFO L93 Difference]: Finished difference Result 7006 states and 9121 transitions. [2019-10-03 02:53:48,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:53:48,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2019-10-03 02:53:48,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:48,164 INFO L225 Difference]: With dead ends: 7006 [2019-10-03 02:53:48,164 INFO L226 Difference]: Without dead ends: 6302 [2019-10-03 02:53:48,165 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:53:48,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6302 states. [2019-10-03 02:53:48,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6302 to 6112. [2019-10-03 02:53:48,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6112 states. [2019-10-03 02:53:48,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6112 states to 6112 states and 8005 transitions. [2019-10-03 02:53:48,375 INFO L78 Accepts]: Start accepts. Automaton has 6112 states and 8005 transitions. Word has length 195 [2019-10-03 02:53:48,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:48,377 INFO L475 AbstractCegarLoop]: Abstraction has 6112 states and 8005 transitions. [2019-10-03 02:53:48,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:53:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 6112 states and 8005 transitions. [2019-10-03 02:53:48,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-03 02:53:48,390 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:48,391 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] [2019-10-03 02:53:48,391 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:48,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:48,392 INFO L82 PathProgramCache]: Analyzing trace with hash -2087107406, now seen corresponding path program 1 times [2019-10-03 02:53:48,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:48,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:48,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:48,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:48,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:48,568 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:53:48,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:48,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:53:48,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:48,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:53:48,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:53:48,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:53:48,571 INFO L87 Difference]: Start difference. First operand 6112 states and 8005 transitions. Second operand 3 states. [2019-10-03 02:53:48,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:48,625 INFO L93 Difference]: Finished difference Result 6440 states and 8606 transitions. [2019-10-03 02:53:48,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:53:48,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-10-03 02:53:48,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:48,696 INFO L225 Difference]: With dead ends: 6440 [2019-10-03 02:53:48,696 INFO L226 Difference]: Without dead ends: 6440 [2019-10-03 02:53:48,697 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:48,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6440 states. [2019-10-03 02:53:49,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6440 to 6436. [2019-10-03 02:53:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6436 states. [2019-10-03 02:53:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6436 states to 6436 states and 8602 transitions. [2019-10-03 02:53:49,043 INFO L78 Accepts]: Start accepts. Automaton has 6436 states and 8602 transitions. Word has length 224 [2019-10-03 02:53:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:49,044 INFO L475 AbstractCegarLoop]: Abstraction has 6436 states and 8602 transitions. [2019-10-03 02:53:49,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:53:49,045 INFO L276 IsEmpty]: Start isEmpty. Operand 6436 states and 8602 transitions. [2019-10-03 02:53:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-03 02:53:49,065 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:49,065 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] [2019-10-03 02:53:49,066 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:49,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:49,066 INFO L82 PathProgramCache]: Analyzing trace with hash 186929642, now seen corresponding path program 1 times [2019-10-03 02:53:49,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:49,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:49,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:49,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:49,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:49,235 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:53:49,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:49,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:53:49,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:49,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:53:49,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:53:49,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:53:49,237 INFO L87 Difference]: Start difference. First operand 6436 states and 8602 transitions. Second operand 3 states. [2019-10-03 02:53:49,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:49,281 INFO L93 Difference]: Finished difference Result 7048 states and 9728 transitions. [2019-10-03 02:53:49,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:53:49,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-10-03 02:53:49,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:49,318 INFO L225 Difference]: With dead ends: 7048 [2019-10-03 02:53:49,318 INFO L226 Difference]: Without dead ends: 7048 [2019-10-03 02:53:49,319 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:49,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7048 states. [2019-10-03 02:53:49,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7048 to 7044. [2019-10-03 02:53:49,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7044 states. [2019-10-03 02:53:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7044 states to 7044 states and 9724 transitions. [2019-10-03 02:53:49,531 INFO L78 Accepts]: Start accepts. Automaton has 7044 states and 9724 transitions. Word has length 231 [2019-10-03 02:53:49,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:49,532 INFO L475 AbstractCegarLoop]: Abstraction has 7044 states and 9724 transitions. [2019-10-03 02:53:49,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:53:49,532 INFO L276 IsEmpty]: Start isEmpty. Operand 7044 states and 9724 transitions. [2019-10-03 02:53:49,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-03 02:53:49,548 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:49,548 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] [2019-10-03 02:53:49,549 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:49,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:49,549 INFO L82 PathProgramCache]: Analyzing trace with hash 671591012, now seen corresponding path program 1 times [2019-10-03 02:53:49,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:49,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:49,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:49,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:49,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:49,768 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:53:49,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:49,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:53:49,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:49,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:53:49,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:53:49,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:53:49,770 INFO L87 Difference]: Start difference. First operand 7044 states and 9724 transitions. Second operand 8 states. [2019-10-03 02:53:54,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:54,175 INFO L93 Difference]: Finished difference Result 14519 states and 21167 transitions. [2019-10-03 02:53:54,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:53:54,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 232 [2019-10-03 02:53:54,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:54,248 INFO L225 Difference]: With dead ends: 14519 [2019-10-03 02:53:54,248 INFO L226 Difference]: Without dead ends: 14519 [2019-10-03 02:53:54,249 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:53:54,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14519 states. [2019-10-03 02:53:54,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14519 to 9228. [2019-10-03 02:53:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9228 states. [2019-10-03 02:53:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9228 states to 9228 states and 14128 transitions. [2019-10-03 02:53:54,561 INFO L78 Accepts]: Start accepts. Automaton has 9228 states and 14128 transitions. Word has length 232 [2019-10-03 02:53:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:54,563 INFO L475 AbstractCegarLoop]: Abstraction has 9228 states and 14128 transitions. [2019-10-03 02:53:54,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:53:54,563 INFO L276 IsEmpty]: Start isEmpty. Operand 9228 states and 14128 transitions. [2019-10-03 02:53:54,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-03 02:53:54,603 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:54,603 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] [2019-10-03 02:53:54,604 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:54,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:54,604 INFO L82 PathProgramCache]: Analyzing trace with hash -567939663, now seen corresponding path program 1 times [2019-10-03 02:53:54,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:54,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:54,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:54,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:54,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:54,814 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:53:54,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:54,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:53:54,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:54,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:53:54,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:53:54,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:53:54,816 INFO L87 Difference]: Start difference. First operand 9228 states and 14128 transitions. Second operand 8 states. [2019-10-03 02:53:58,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:58,959 INFO L93 Difference]: Finished difference Result 19423 states and 31879 transitions. [2019-10-03 02:53:58,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:53:58,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 233 [2019-10-03 02:53:58,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:59,068 INFO L225 Difference]: With dead ends: 19423 [2019-10-03 02:53:59,068 INFO L226 Difference]: Without dead ends: 19423 [2019-10-03 02:53:59,069 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:53:59,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19423 states. [2019-10-03 02:53:59,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19423 to 13716. [2019-10-03 02:53:59,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13716 states. [2019-10-03 02:53:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13716 states to 13716 states and 23776 transitions. [2019-10-03 02:53:59,666 INFO L78 Accepts]: Start accepts. Automaton has 13716 states and 23776 transitions. Word has length 233 [2019-10-03 02:53:59,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:59,667 INFO L475 AbstractCegarLoop]: Abstraction has 13716 states and 23776 transitions. [2019-10-03 02:53:59,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:53:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 13716 states and 23776 transitions. [2019-10-03 02:53:59,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-03 02:53:59,764 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:59,765 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] [2019-10-03 02:53:59,765 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:59,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:59,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2060178440, now seen corresponding path program 1 times [2019-10-03 02:53:59,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:59,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:59,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:59,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:59,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:00,599 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:00,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:00,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:54:00,600 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:00,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:54:00,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:54:00,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:54:00,602 INFO L87 Difference]: Start difference. First operand 13716 states and 23776 transitions. Second operand 8 states. [2019-10-03 02:54:04,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:04,556 INFO L93 Difference]: Finished difference Result 29383 states and 54939 transitions. [2019-10-03 02:54:04,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:54:04,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 234 [2019-10-03 02:54:04,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:04,698 INFO L225 Difference]: With dead ends: 29383 [2019-10-03 02:54:04,699 INFO L226 Difference]: Without dead ends: 29383 [2019-10-03 02:54:04,699 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:04,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29383 states. [2019-10-03 02:54:05,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29383 to 22820. [2019-10-03 02:54:05,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22820 states. [2019-10-03 02:54:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22820 states to 22820 states and 44612 transitions. [2019-10-03 02:54:05,495 INFO L78 Accepts]: Start accepts. Automaton has 22820 states and 44612 transitions. Word has length 234 [2019-10-03 02:54:05,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:05,496 INFO L475 AbstractCegarLoop]: Abstraction has 22820 states and 44612 transitions. [2019-10-03 02:54:05,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:54:05,496 INFO L276 IsEmpty]: Start isEmpty. Operand 22820 states and 44612 transitions. [2019-10-03 02:54:05,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-03 02:54:05,623 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:05,623 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] [2019-10-03 02:54:05,624 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:05,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:05,624 INFO L82 PathProgramCache]: Analyzing trace with hash 468687140, now seen corresponding path program 1 times [2019-10-03 02:54:05,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:05,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:05,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:05,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:05,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:05,769 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:05,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:05,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:05,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:05,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:05,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:05,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:05,771 INFO L87 Difference]: Start difference. First operand 22820 states and 44612 transitions. Second operand 3 states. [2019-10-03 02:54:05,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:05,997 INFO L93 Difference]: Finished difference Result 32168 states and 67528 transitions. [2019-10-03 02:54:05,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:05,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-10-03 02:54:05,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:06,200 INFO L225 Difference]: With dead ends: 32168 [2019-10-03 02:54:06,200 INFO L226 Difference]: Without dead ends: 32168 [2019-10-03 02:54:06,201 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:06,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32168 states. [2019-10-03 02:54:08,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32168 to 32164. [2019-10-03 02:54:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32164 states. [2019-10-03 02:54:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32164 states to 32164 states and 67524 transitions. [2019-10-03 02:54:08,422 INFO L78 Accepts]: Start accepts. Automaton has 32164 states and 67524 transitions. Word has length 239 [2019-10-03 02:54:08,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:08,423 INFO L475 AbstractCegarLoop]: Abstraction has 32164 states and 67524 transitions. [2019-10-03 02:54:08,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:08,424 INFO L276 IsEmpty]: Start isEmpty. Operand 32164 states and 67524 transitions. [2019-10-03 02:54:08,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-03 02:54:08,635 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:08,635 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] [2019-10-03 02:54:08,636 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:08,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:08,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1281939217, now seen corresponding path program 1 times [2019-10-03 02:54:08,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:08,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:08,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:08,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:08,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:08,983 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-03 02:54:08,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:08,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:54:08,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:08,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:54:08,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:54:08,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:54:08,986 INFO L87 Difference]: Start difference. First operand 32164 states and 67524 transitions. Second operand 11 states. [2019-10-03 02:54:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:10,363 INFO L93 Difference]: Finished difference Result 36810 states and 73541 transitions. [2019-10-03 02:54:10,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-03 02:54:10,363 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 238 [2019-10-03 02:54:10,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:10,565 INFO L225 Difference]: With dead ends: 36810 [2019-10-03 02:54:10,565 INFO L226 Difference]: Without dead ends: 36806 [2019-10-03 02:54:10,568 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-10-03 02:54:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36806 states. [2019-10-03 02:54:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36806 to 36524. [2019-10-03 02:54:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36524 states. [2019-10-03 02:54:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36524 states to 36524 states and 73191 transitions. [2019-10-03 02:54:14,189 INFO L78 Accepts]: Start accepts. Automaton has 36524 states and 73191 transitions. Word has length 238 [2019-10-03 02:54:14,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:14,190 INFO L475 AbstractCegarLoop]: Abstraction has 36524 states and 73191 transitions. [2019-10-03 02:54:14,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:54:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand 36524 states and 73191 transitions. [2019-10-03 02:54:14,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-03 02:54:14,363 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:14,364 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] [2019-10-03 02:54:14,364 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:14,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:14,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1874639360, now seen corresponding path program 1 times [2019-10-03 02:54:14,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:14,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:14,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:14,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:14,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:54:15,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:54:15,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:54:15,916 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 234 with the following transitions: [2019-10-03 02:54:15,919 INFO L207 CegarAbsIntRunner]: [72], [75], [85], [105], [108], [123], [139], [142], [143], [146], [155], [156], [157], [159], [255], [258], [264], [269], [271], [275], [278], [279], [280], [283], [289], [326], [329], [338], [349], [351], [352], [355], [365], [368], [370], [373], [375], [377], [394], [397], [406], [507], [510], [520], [582], [584], [585], [586], [604], [607], [621], [624], [627], [641], [670], [671], [682], [684], [686], [689], [693], [696], [698], [712], [716], [719], [737], [740], [765], [799], [808], [812], [814], [816], [819], [826], [833], [838], [845], [852], [859], [862], [864], [1046], [1049], [1052], [1096], [1097], [1100], [1103], [1106], [1150], [1169], [1171], [1173], [1176], [1184], [1195], [1198], [1199], [1202], [1205], [1236], [1237], [1239], [1322], [1325], [1331], [1352], [1355], [1369], [1377], [1380], [1389], [1456], [1459], [1461], [1463], [1465], [1470], [1480], [1482], [1483], [1603], [1605], [1607], [1609], [1610], [1634], [1635], [1636], [1637], [1638], [1639], [1640], [1650], [1651], [1652], [1653], [1654], [1655], [1658], [1659], [1660], [1661], [1662], [1664], [1665], [1666], [1667], [1684], [1685], [1686], [1687], [1688], [1689], [1710], [1711], [1726], [1727], [1728], [1729], [1730], [1732], [1733], [1734], [1735], [1736], [1737], [1738], [1739], [1740], [1742], [1743], [1744], [1745], [1754], [1776], [1777], [1790], [1792], [1793], [1794], [1795], [1796], [1797], [1798], [1799], [1800], [1802], [1803], [1804], [1805], [1806], [1807], [1808], [1816], [1817], [1818], [1819], [1820], [1821], [1822], [1826], [1827], [1832], [1833], [1834], [1835], [1836], [1837], [1838], [1839], [1840] [2019-10-03 02:54:15,962 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:54:15,962 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:54:16,099 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:54:16,101 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 204 root evaluator evaluations with a maximum evaluation depth of 0. Performed 204 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 374 variables. [2019-10-03 02:54:16,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:16,107 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:54:16,185 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:54:16,186 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:54:16,191 INFO L420 sIntCurrentIteration]: We unified 232 AI predicates to 232 [2019-10-03 02:54:16,191 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:54:16,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:54:16,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [50] total 50 [2019-10-03 02:54:16,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:16,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:54:16,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:54:16,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:54:16,197 INFO L87 Difference]: Start difference. First operand 36524 states and 73191 transitions. Second operand 2 states. [2019-10-03 02:54:16,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:16,198 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:54:16,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:54:16,198 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 233 [2019-10-03 02:54:16,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:16,199 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:54:16,199 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:54:16,199 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 232 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:16,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:54:16,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:54:16,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:54:16,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:54:16,200 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 233 [2019-10-03 02:54:16,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:16,200 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:54:16,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:54:16,200 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:54:16,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:54:16,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:54:16 BoogieIcfgContainer [2019-10-03 02:54:16,206 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:54:16,209 INFO L168 Benchmark]: Toolchain (without parser) took 43054.61 ms. Allocated memory was 130.5 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 83.6 MB in the beginning and 723.2 MB in the end (delta: -639.6 MB). Peak memory consumption was 729.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:54:16,209 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 130.5 MB. Free memory was 104.7 MB in the beginning and 104.5 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:16,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1308.77 ms. Allocated memory was 130.5 MB in the beginning and 199.2 MB in the end (delta: 68.7 MB). Free memory was 83.4 MB in the beginning and 132.1 MB in the end (delta: -48.7 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:54:16,211 INFO L168 Benchmark]: Boogie Preprocessor took 161.03 ms. Allocated memory is still 199.2 MB. Free memory was 132.1 MB in the beginning and 122.9 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-10-03 02:54:16,212 INFO L168 Benchmark]: RCFGBuilder took 2438.33 ms. Allocated memory was 199.2 MB in the beginning and 275.3 MB in the end (delta: 76.0 MB). Free memory was 122.9 MB in the beginning and 183.5 MB in the end (delta: -60.6 MB). Peak memory consumption was 85.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:54:16,213 INFO L168 Benchmark]: TraceAbstraction took 39141.74 ms. Allocated memory was 275.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 183.5 MB in the beginning and 723.2 MB in the end (delta: -539.7 MB). Peak memory consumption was 685.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:54:16,217 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.23 ms. Allocated memory is still 130.5 MB. Free memory was 104.7 MB in the beginning and 104.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1308.77 ms. Allocated memory was 130.5 MB in the beginning and 199.2 MB in the end (delta: 68.7 MB). Free memory was 83.4 MB in the beginning and 132.1 MB in the end (delta: -48.7 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 161.03 ms. Allocated memory is still 199.2 MB. Free memory was 132.1 MB in the beginning and 122.9 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2438.33 ms. Allocated memory was 199.2 MB in the beginning and 275.3 MB in the end (delta: 76.0 MB). Free memory was 122.9 MB in the beginning and 183.5 MB in the end (delta: -60.6 MB). Peak memory consumption was 85.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 39141.74 ms. Allocated memory was 275.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 183.5 MB in the beginning and 723.2 MB in the end (delta: -539.7 MB). Peak memory consumption was 685.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1842]: 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 110 procedures, 748 locations, 1 error locations. SAFE Result, 39.0s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 22.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10808 SDtfs, 8568 SDslu, 34581 SDs, 0 SdLazy, 14799 SolverSat, 2433 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 441 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36524occurred in iteration=15, 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, 2.0474137931034484 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 9.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 18316 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 3353 NumberOfCodeBlocks, 3353 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3337 ConstructedInterpolants, 0 QuantifiedInterpolants, 1042291 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 586/588 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...