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_spec0_product40.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:49:56,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:49:56,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:49:56,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:49:56,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:49:56,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:49:56,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:49:56,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:49:56,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:49:56,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:49:56,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:49:56,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:49:56,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:49:56,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:49:56,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:49:56,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:49:56,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:49:56,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:49:56,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:49:56,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:49:56,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:49:56,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:49:56,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:49:56,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:49:56,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:49:56,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:49:56,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:49:56,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:49:56,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:49:56,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:49:56,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:49:56,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:49:56,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:49:56,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:49:56,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:49:56,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:49:56,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:49:56,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:49:56,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:49:56,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:49:56,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:49:56,708 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:49:56,723 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:49:56,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:49:56,723 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:49:56,724 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:49:56,724 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:49:56,725 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:49:56,725 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:49:56,725 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:49:56,725 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:49:56,725 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:49:56,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:49:56,726 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:49:56,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:49:56,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:49:56,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:49:56,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:49:56,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:49:56,728 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:49:56,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:49:56,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:49:56,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:49:56,728 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:49:56,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:49:56,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:49:56,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:49:56,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:49:56,729 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:49:56,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:49:56,730 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:49:56,730 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:49:56,760 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:49:56,773 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:49:56,776 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:49:56,778 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:49:56,778 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:49:56,779 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product40.cil.c [2019-10-03 02:49:56,852 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98d52cd6c/e1f8f496546f43f69d1949b207932f5f/FLAG4c92887f3 [2019-10-03 02:49:57,417 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:49:57,427 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product40.cil.c [2019-10-03 02:49:57,454 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98d52cd6c/e1f8f496546f43f69d1949b207932f5f/FLAG4c92887f3 [2019-10-03 02:49:57,643 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98d52cd6c/e1f8f496546f43f69d1949b207932f5f [2019-10-03 02:49:57,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:49:57,655 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:49:57,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:49:57,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:49:57,660 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:49:57,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:49:57" (1/1) ... [2019-10-03 02:49:57,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5277e3e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:49:57, skipping insertion in model container [2019-10-03 02:49:57,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:49:57" (1/1) ... [2019-10-03 02:49:57,673 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:49:57,762 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:49:58,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:49:58,662 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:49:58,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:49:58,900 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:49:58,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:49:58 WrapperNode [2019-10-03 02:49:58,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:49:58,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:49:58,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:49:58,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:49:58,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:49:58" (1/1) ... [2019-10-03 02:49:58,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:49:58" (1/1) ... [2019-10-03 02:49:58,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:49:58" (1/1) ... [2019-10-03 02:49:58,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:49:58" (1/1) ... [2019-10-03 02:49:59,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:49:58" (1/1) ... [2019-10-03 02:49:59,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:49:58" (1/1) ... [2019-10-03 02:49:59,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:49:58" (1/1) ... [2019-10-03 02:49:59,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:49:59,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:49:59,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:49:59,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:49:59,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:49:58" (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:49:59,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:49:59,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:49:59,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:49:59,241 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-03 02:49:59,241 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:49:59,241 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-03 02:49:59,241 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:49:59,242 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-03 02:49:59,242 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:49:59,243 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:49:59,243 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:49:59,244 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:49:59,244 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:49:59,245 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:49:59,245 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:49:59,246 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:49:59,246 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:49:59,246 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:49:59,246 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:49:59,247 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:49:59,247 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:49:59,247 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:49:59,247 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-03 02:49:59,248 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-03 02:49:59,248 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-03 02:49:59,249 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:49:59,249 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:49:59,249 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:49:59,249 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:49:59,249 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:49:59,249 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Keys [2019-10-03 02:49:59,250 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-03 02:49:59,250 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:49:59,250 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:49:59,250 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:49:59,250 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:49:59,251 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:49:59,251 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:49:59,251 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:49:59,251 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:49:59,252 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:49:59,252 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-03 02:49:59,252 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-03 02:49:59,252 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-03 02:49:59,252 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:49:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:49:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:49:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:49:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:49:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:49:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:49:59,254 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:49:59,254 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:49:59,254 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:49:59,255 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:49:59,255 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:49:59,255 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:49:59,255 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:49:59,255 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:49:59,256 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:49:59,256 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:49:59,256 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:49:59,256 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:49:59,256 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:49:59,257 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:49:59,257 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:49:59,257 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:49:59,258 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:49:59,258 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:49:59,258 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:49:59,258 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:49:59,258 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:49:59,259 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:49:59,259 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:49:59,259 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:49:59,260 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:49:59,260 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:49:59,260 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2019-10-03 02:49:59,260 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:49:59,261 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:49:59,261 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:49:59,261 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:49:59,261 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:49:59,262 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:49:59,262 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:49:59,263 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:49:59,263 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:49:59,263 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:49:59,264 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:49:59,264 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:49:59,264 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:49:59,264 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:49:59,264 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:49:59,265 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:49:59,265 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:49:59,265 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:49:59,265 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:49:59,265 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:49:59,265 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:49:59,266 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:49:59,266 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:49:59,266 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:49:59,266 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:49:59,266 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:49:59,266 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:49:59,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:49:59,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:49:59,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:49:59,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:49:59,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:49:59,268 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:49:59,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:49:59,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:49:59,268 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:49:59,268 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:49:59,269 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:49:59,269 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:49:59,270 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:49:59,270 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:49:59,270 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:49:59,270 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:49:59,270 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:49:59,270 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:49:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:49:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:49:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:49:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:49:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:49:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:49:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:49:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:49:59,272 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:49:59,272 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:49:59,272 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:49:59,272 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:49:59,273 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:49:59,273 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:49:59,274 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:49:59,274 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:49:59,280 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:49:59,281 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:49:59,281 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:49:59,282 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:49:59,287 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:49:59,287 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:49:59,287 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:49:59,287 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:49:59,288 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:49:59,288 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:49:59,288 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:49:59,288 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:49:59,288 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:49:59,288 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:49:59,288 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-03 02:49:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-03 02:49:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-03 02:49:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-03 02:49:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-03 02:49:59,290 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-03 02:49:59,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:49:59,290 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:49:59,290 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:49:59,291 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:49:59,291 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:49:59,291 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:49:59,291 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:49:59,291 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:49:59,291 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:49:59,291 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:49:59,292 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:49:59,292 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:49:59,292 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:49:59,292 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:49:59,292 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:49:59,292 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:49:59,292 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:49:59,292 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:49:59,293 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:49:59,293 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:49:59,293 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-03 02:49:59,293 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-03 02:49:59,293 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-03 02:49:59,293 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:49:59,293 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Keys [2019-10-03 02:49:59,294 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-03 02:49:59,294 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2019-10-03 02:49:59,294 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:49:59,294 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:49:59,294 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:49:59,294 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:49:59,294 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:49:59,294 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:49:59,295 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:49:59,295 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:49:59,295 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:49:59,295 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:49:59,295 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:49:59,295 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:49:59,295 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:49:59,295 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:49:59,296 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:49:59,296 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:49:59,296 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:49:59,296 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:49:59,296 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:49:59,296 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:49:59,296 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:49:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:49:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:49:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:49:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:49:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:49:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:49:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:49:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:49:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:49:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:49:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:49:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:49:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:49:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:49:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:49:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:49:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:49:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:49:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:49:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:49:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:49:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:49:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:49:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:49:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:49:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:49:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:49:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:49:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:49:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:50:01,392 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:50:01,393 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:50:01,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:50:01 BoogieIcfgContainer [2019-10-03 02:50:01,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:50:01,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:50:01,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:50:01,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:50:01,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:49:57" (1/3) ... [2019-10-03 02:50:01,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241d128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:50:01, skipping insertion in model container [2019-10-03 02:50:01,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:49:58" (2/3) ... [2019-10-03 02:50:01,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241d128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:50:01, skipping insertion in model container [2019-10-03 02:50:01,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:50:01" (3/3) ... [2019-10-03 02:50:01,404 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product40.cil.c [2019-10-03 02:50:01,415 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:50:01,426 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:50:01,446 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:50:01,476 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:50:01,476 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:50:01,476 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:50:01,476 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:50:01,477 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:50:01,477 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:50:01,477 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:50:01,477 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:50:01,506 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states. [2019-10-03 02:50:01,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-03 02:50:01,536 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:01,538 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:50:01,541 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:01,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:01,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2061409221, now seen corresponding path program 1 times [2019-10-03 02:50:01,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:01,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:01,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:01,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:01,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:02,345 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:02,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:02,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:50:02,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:02,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:50:02,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:50:02,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:50:02,376 INFO L87 Difference]: Start difference. First operand 511 states. Second operand 2 states. [2019-10-03 02:50:02,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:02,442 INFO L93 Difference]: Finished difference Result 491 states and 666 transitions. [2019-10-03 02:50:02,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:50:02,445 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 177 [2019-10-03 02:50:02,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:02,490 INFO L225 Difference]: With dead ends: 491 [2019-10-03 02:50:02,490 INFO L226 Difference]: Without dead ends: 482 [2019-10-03 02:50:02,494 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:50:02,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-10-03 02:50:02,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-10-03 02:50:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-10-03 02:50:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 655 transitions. [2019-10-03 02:50:02,641 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 655 transitions. Word has length 177 [2019-10-03 02:50:02,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:02,644 INFO L475 AbstractCegarLoop]: Abstraction has 482 states and 655 transitions. [2019-10-03 02:50:02,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:50:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 655 transitions. [2019-10-03 02:50:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-03 02:50:02,650 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:02,651 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:02,651 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:02,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:02,652 INFO L82 PathProgramCache]: Analyzing trace with hash -956753639, now seen corresponding path program 1 times [2019-10-03 02:50:02,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:02,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:02,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:02,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:02,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:02,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:02,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:02,888 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:02,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:02,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:02,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:02,891 INFO L87 Difference]: Start difference. First operand 482 states and 655 transitions. Second operand 3 states. [2019-10-03 02:50:02,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:02,938 INFO L93 Difference]: Finished difference Result 485 states and 658 transitions. [2019-10-03 02:50:02,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:02,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-10-03 02:50:02,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:02,944 INFO L225 Difference]: With dead ends: 485 [2019-10-03 02:50:02,944 INFO L226 Difference]: Without dead ends: 485 [2019-10-03 02:50:02,945 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:02,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-10-03 02:50:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 484. [2019-10-03 02:50:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-10-03 02:50:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 657 transitions. [2019-10-03 02:50:02,978 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 657 transitions. Word has length 178 [2019-10-03 02:50:02,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:02,979 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 657 transitions. [2019-10-03 02:50:02,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 657 transitions. [2019-10-03 02:50:02,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-03 02:50:02,983 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:02,983 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:02,983 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:02,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:02,984 INFO L82 PathProgramCache]: Analyzing trace with hash 239347080, now seen corresponding path program 1 times [2019-10-03 02:50:02,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:02,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:02,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:02,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:02,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:03,228 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:03,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:03,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:03,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:03,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:03,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:03,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:03,232 INFO L87 Difference]: Start difference. First operand 484 states and 657 transitions. Second operand 3 states. [2019-10-03 02:50:03,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:03,264 INFO L93 Difference]: Finished difference Result 529 states and 733 transitions. [2019-10-03 02:50:03,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:03,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-10-03 02:50:03,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:03,270 INFO L225 Difference]: With dead ends: 529 [2019-10-03 02:50:03,271 INFO L226 Difference]: Without dead ends: 529 [2019-10-03 02:50:03,271 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:03,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-10-03 02:50:03,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 528. [2019-10-03 02:50:03,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-10-03 02:50:03,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 732 transitions. [2019-10-03 02:50:03,300 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 732 transitions. Word has length 190 [2019-10-03 02:50:03,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:03,301 INFO L475 AbstractCegarLoop]: Abstraction has 528 states and 732 transitions. [2019-10-03 02:50:03,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:03,301 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 732 transitions. [2019-10-03 02:50:03,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-03 02:50:03,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:03,306 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:03,307 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:03,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:03,307 INFO L82 PathProgramCache]: Analyzing trace with hash 459421880, now seen corresponding path program 1 times [2019-10-03 02:50:03,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:03,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:03,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:03,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:03,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:03,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:03,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:03,520 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:03,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:03,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:03,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:03,521 INFO L87 Difference]: Start difference. First operand 528 states and 732 transitions. Second operand 3 states. [2019-10-03 02:50:03,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:03,551 INFO L93 Difference]: Finished difference Result 614 states and 877 transitions. [2019-10-03 02:50:03,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:03,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2019-10-03 02:50:03,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:03,560 INFO L225 Difference]: With dead ends: 614 [2019-10-03 02:50:03,560 INFO L226 Difference]: Without dead ends: 614 [2019-10-03 02:50:03,561 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:03,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-03 02:50:03,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 613. [2019-10-03 02:50:03,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-03 02:50:03,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 876 transitions. [2019-10-03 02:50:03,607 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 876 transitions. Word has length 191 [2019-10-03 02:50:03,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:03,608 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 876 transitions. [2019-10-03 02:50:03,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 876 transitions. [2019-10-03 02:50:03,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-03 02:50:03,618 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:03,618 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:03,619 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:03,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:03,619 INFO L82 PathProgramCache]: Analyzing trace with hash 655741416, now seen corresponding path program 1 times [2019-10-03 02:50:03,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:03,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:03,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:03,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:03,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:03,875 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:03,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:03,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:03,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:03,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:03,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:03,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:03,879 INFO L87 Difference]: Start difference. First operand 613 states and 876 transitions. Second operand 3 states. [2019-10-03 02:50:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:03,920 INFO L93 Difference]: Finished difference Result 778 states and 1153 transitions. [2019-10-03 02:50:03,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:03,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-03 02:50:03,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:03,929 INFO L225 Difference]: With dead ends: 778 [2019-10-03 02:50:03,930 INFO L226 Difference]: Without dead ends: 778 [2019-10-03 02:50:03,930 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:03,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-10-03 02:50:03,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 777. [2019-10-03 02:50:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-10-03 02:50:03,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1152 transitions. [2019-10-03 02:50:03,973 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1152 transitions. Word has length 192 [2019-10-03 02:50:03,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:03,974 INFO L475 AbstractCegarLoop]: Abstraction has 777 states and 1152 transitions. [2019-10-03 02:50:03,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:03,974 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1152 transitions. [2019-10-03 02:50:03,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-03 02:50:03,982 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:03,982 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:50:03,982 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:03,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:03,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1935139716, now seen corresponding path program 1 times [2019-10-03 02:50:03,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:03,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:03,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:03,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:03,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:04,391 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:04,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:04,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-03 02:50:04,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:04,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 02:50:04,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 02:50:04,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:50:04,394 INFO L87 Difference]: Start difference. First operand 777 states and 1152 transitions. Second operand 13 states. [2019-10-03 02:50:07,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:07,129 INFO L93 Difference]: Finished difference Result 1504 states and 2251 transitions. [2019-10-03 02:50:07,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 02:50:07,129 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 194 [2019-10-03 02:50:07,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:07,138 INFO L225 Difference]: With dead ends: 1504 [2019-10-03 02:50:07,139 INFO L226 Difference]: Without dead ends: 1504 [2019-10-03 02:50:07,139 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-10-03 02:50:07,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2019-10-03 02:50:07,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1496. [2019-10-03 02:50:07,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-10-03 02:50:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2243 transitions. [2019-10-03 02:50:07,198 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2243 transitions. Word has length 194 [2019-10-03 02:50:07,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:07,199 INFO L475 AbstractCegarLoop]: Abstraction has 1496 states and 2243 transitions. [2019-10-03 02:50:07,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 02:50:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2243 transitions. [2019-10-03 02:50:07,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-03 02:50:07,208 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:07,208 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:07,208 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:07,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:07,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1955843160, now seen corresponding path program 1 times [2019-10-03 02:50:07,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:07,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:07,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:07,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:07,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:07,350 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:07,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:07,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:07,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:07,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:07,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:07,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:07,352 INFO L87 Difference]: Start difference. First operand 1496 states and 2243 transitions. Second operand 3 states. [2019-10-03 02:50:07,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:07,383 INFO L93 Difference]: Finished difference Result 2130 states and 3305 transitions. [2019-10-03 02:50:07,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:07,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-10-03 02:50:07,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:07,399 INFO L225 Difference]: With dead ends: 2130 [2019-10-03 02:50:07,399 INFO L226 Difference]: Without dead ends: 2130 [2019-10-03 02:50:07,400 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:07,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2019-10-03 02:50:07,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 2128. [2019-10-03 02:50:07,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2128 states. [2019-10-03 02:50:07,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 3303 transitions. [2019-10-03 02:50:07,510 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 3303 transitions. Word has length 193 [2019-10-03 02:50:07,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:07,512 INFO L475 AbstractCegarLoop]: Abstraction has 2128 states and 3303 transitions. [2019-10-03 02:50:07,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:07,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 3303 transitions. [2019-10-03 02:50:07,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-03 02:50:07,568 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:07,569 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:07,569 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:07,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:07,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1693972236, now seen corresponding path program 1 times [2019-10-03 02:50:07,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:07,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:07,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:07,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:07,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:07,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:07,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:50:07,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:07,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:50:07,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:50:07,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:50:07,894 INFO L87 Difference]: Start difference. First operand 2128 states and 3303 transitions. Second operand 9 states. [2019-10-03 02:50:08,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:08,082 INFO L93 Difference]: Finished difference Result 2151 states and 3335 transitions. [2019-10-03 02:50:08,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:50:08,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2019-10-03 02:50:08,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:08,097 INFO L225 Difference]: With dead ends: 2151 [2019-10-03 02:50:08,097 INFO L226 Difference]: Without dead ends: 2151 [2019-10-03 02:50:08,098 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:50:08,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2151 states. [2019-10-03 02:50:08,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2151 to 2139. [2019-10-03 02:50:08,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2139 states. [2019-10-03 02:50:08,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 3317 transitions. [2019-10-03 02:50:08,197 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 3317 transitions. Word has length 195 [2019-10-03 02:50:08,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:08,198 INFO L475 AbstractCegarLoop]: Abstraction has 2139 states and 3317 transitions. [2019-10-03 02:50:08,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:50:08,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 3317 transitions. [2019-10-03 02:50:08,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-03 02:50:08,211 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:08,212 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:08,212 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:08,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:08,212 INFO L82 PathProgramCache]: Analyzing trace with hash 839709138, now seen corresponding path program 1 times [2019-10-03 02:50:08,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:08,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:08,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:08,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:08,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:08,396 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:08,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:08,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:50:08,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:08,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:50:08,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:50:08,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:50:08,398 INFO L87 Difference]: Start difference. First operand 2139 states and 3317 transitions. Second operand 6 states. [2019-10-03 02:50:08,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:08,986 INFO L93 Difference]: Finished difference Result 4229 states and 6613 transitions. [2019-10-03 02:50:08,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:50:08,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-10-03 02:50:08,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:09,015 INFO L225 Difference]: With dead ends: 4229 [2019-10-03 02:50:09,015 INFO L226 Difference]: Without dead ends: 4229 [2019-10-03 02:50:09,016 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:50:09,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4229 states. [2019-10-03 02:50:09,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4229 to 4218. [2019-10-03 02:50:09,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4218 states. [2019-10-03 02:50:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4218 states to 4218 states and 6603 transitions. [2019-10-03 02:50:09,205 INFO L78 Accepts]: Start accepts. Automaton has 4218 states and 6603 transitions. Word has length 195 [2019-10-03 02:50:09,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:09,206 INFO L475 AbstractCegarLoop]: Abstraction has 4218 states and 6603 transitions. [2019-10-03 02:50:09,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:50:09,206 INFO L276 IsEmpty]: Start isEmpty. Operand 4218 states and 6603 transitions. [2019-10-03 02:50:09,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-03 02:50:09,225 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:09,226 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:09,226 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:09,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:09,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1262166346, now seen corresponding path program 1 times [2019-10-03 02:50:09,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:09,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:09,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:09,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:09,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:09,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:09,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:50:09,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:09,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:50:09,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:50:09,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:50:09,401 INFO L87 Difference]: Start difference. First operand 4218 states and 6603 transitions. Second operand 6 states. [2019-10-03 02:50:09,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:09,974 INFO L93 Difference]: Finished difference Result 8415 states and 13253 transitions. [2019-10-03 02:50:09,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:50:09,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 196 [2019-10-03 02:50:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:10,032 INFO L225 Difference]: With dead ends: 8415 [2019-10-03 02:50:10,032 INFO L226 Difference]: Without dead ends: 8415 [2019-10-03 02:50:10,032 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:50:10,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8415 states. [2019-10-03 02:50:10,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8415 to 8376. [2019-10-03 02:50:10,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8376 states. [2019-10-03 02:50:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8376 states to 8376 states and 13209 transitions. [2019-10-03 02:50:10,585 INFO L78 Accepts]: Start accepts. Automaton has 8376 states and 13209 transitions. Word has length 196 [2019-10-03 02:50:10,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:10,589 INFO L475 AbstractCegarLoop]: Abstraction has 8376 states and 13209 transitions. [2019-10-03 02:50:10,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:50:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 8376 states and 13209 transitions. [2019-10-03 02:50:10,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-03 02:50:10,633 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:10,633 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:10,633 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:10,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:10,635 INFO L82 PathProgramCache]: Analyzing trace with hash 2024527560, now seen corresponding path program 1 times [2019-10-03 02:50:10,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:10,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:10,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:10,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:10,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:10,854 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:10,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:10,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:50:10,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:10,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:50:10,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:50:10,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:50:10,857 INFO L87 Difference]: Start difference. First operand 8376 states and 13209 transitions. Second operand 9 states. [2019-10-03 02:50:11,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:11,092 INFO L93 Difference]: Finished difference Result 8496 states and 13373 transitions. [2019-10-03 02:50:11,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:50:11,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 197 [2019-10-03 02:50:11,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:11,175 INFO L225 Difference]: With dead ends: 8496 [2019-10-03 02:50:11,176 INFO L226 Difference]: Without dead ends: 8496 [2019-10-03 02:50:11,177 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:50:11,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8496 states. [2019-10-03 02:50:11,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8496 to 8456. [2019-10-03 02:50:11,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8456 states. [2019-10-03 02:50:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8456 states to 8456 states and 13321 transitions. [2019-10-03 02:50:11,541 INFO L78 Accepts]: Start accepts. Automaton has 8456 states and 13321 transitions. Word has length 197 [2019-10-03 02:50:11,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:11,541 INFO L475 AbstractCegarLoop]: Abstraction has 8456 states and 13321 transitions. [2019-10-03 02:50:11,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:50:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 8456 states and 13321 transitions. [2019-10-03 02:50:11,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-03 02:50:11,587 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:11,587 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:11,588 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:11,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:11,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1416443918, now seen corresponding path program 1 times [2019-10-03 02:50:11,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:11,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:11,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:11,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:11,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:11,950 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:11,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:11,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:50:11,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:11,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:50:11,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:50:11,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:50:11,955 INFO L87 Difference]: Start difference. First operand 8456 states and 13321 transitions. Second operand 9 states. [2019-10-03 02:50:12,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:12,136 INFO L93 Difference]: Finished difference Result 8496 states and 13351 transitions. [2019-10-03 02:50:12,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:50:12,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 197 [2019-10-03 02:50:12,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:12,172 INFO L225 Difference]: With dead ends: 8496 [2019-10-03 02:50:12,172 INFO L226 Difference]: Without dead ends: 8496 [2019-10-03 02:50:12,172 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:50:12,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8496 states. [2019-10-03 02:50:12,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8496 to 8456. [2019-10-03 02:50:12,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8456 states. [2019-10-03 02:50:12,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8456 states to 8456 states and 13299 transitions. [2019-10-03 02:50:12,476 INFO L78 Accepts]: Start accepts. Automaton has 8456 states and 13299 transitions. Word has length 197 [2019-10-03 02:50:12,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:12,476 INFO L475 AbstractCegarLoop]: Abstraction has 8456 states and 13299 transitions. [2019-10-03 02:50:12,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:50:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 8456 states and 13299 transitions. [2019-10-03 02:50:12,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-03 02:50:12,522 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:12,522 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:12,522 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:12,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:12,523 INFO L82 PathProgramCache]: Analyzing trace with hash -457825732, now seen corresponding path program 1 times [2019-10-03 02:50:12,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:12,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:12,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:12,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:12,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:12,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:12,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:50:12,707 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:12,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:50:12,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:50:12,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:50:12,708 INFO L87 Difference]: Start difference. First operand 8456 states and 13299 transitions. Second operand 6 states. [2019-10-03 02:50:13,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:13,345 INFO L93 Difference]: Finished difference Result 16835 states and 26631 transitions. [2019-10-03 02:50:13,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:50:13,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 198 [2019-10-03 02:50:13,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:13,415 INFO L225 Difference]: With dead ends: 16835 [2019-10-03 02:50:13,415 INFO L226 Difference]: Without dead ends: 16468 [2019-10-03 02:50:13,416 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:50:13,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16468 states. [2019-10-03 02:50:14,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16468 to 16407. [2019-10-03 02:50:14,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16407 states. [2019-10-03 02:50:14,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16407 states to 16407 states and 26017 transitions. [2019-10-03 02:50:14,105 INFO L78 Accepts]: Start accepts. Automaton has 16407 states and 26017 transitions. Word has length 198 [2019-10-03 02:50:14,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:14,106 INFO L475 AbstractCegarLoop]: Abstraction has 16407 states and 26017 transitions. [2019-10-03 02:50:14,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:50:14,106 INFO L276 IsEmpty]: Start isEmpty. Operand 16407 states and 26017 transitions. [2019-10-03 02:50:14,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-03 02:50:14,172 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:14,172 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:14,172 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:14,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:14,173 INFO L82 PathProgramCache]: Analyzing trace with hash -125865389, now seen corresponding path program 1 times [2019-10-03 02:50:14,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:14,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:14,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:14,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:14,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:14,337 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:14,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:14,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:14,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:14,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:14,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:14,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:14,339 INFO L87 Difference]: Start difference. First operand 16407 states and 26017 transitions. Second operand 3 states. [2019-10-03 02:50:14,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:14,473 INFO L93 Difference]: Finished difference Result 26149 states and 42511 transitions. [2019-10-03 02:50:14,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:14,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-10-03 02:50:14,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:14,585 INFO L225 Difference]: With dead ends: 26149 [2019-10-03 02:50:14,585 INFO L226 Difference]: Without dead ends: 26149 [2019-10-03 02:50:14,586 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:14,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26149 states. [2019-10-03 02:50:15,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26149 to 26135. [2019-10-03 02:50:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26135 states. [2019-10-03 02:50:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26135 states to 26135 states and 42497 transitions. [2019-10-03 02:50:16,086 INFO L78 Accepts]: Start accepts. Automaton has 26135 states and 42497 transitions. Word has length 201 [2019-10-03 02:50:16,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:16,086 INFO L475 AbstractCegarLoop]: Abstraction has 26135 states and 42497 transitions. [2019-10-03 02:50:16,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:16,086 INFO L276 IsEmpty]: Start isEmpty. Operand 26135 states and 42497 transitions. [2019-10-03 02:50:16,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-03 02:50:16,163 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:16,163 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:16,164 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:16,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:16,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1306151587, now seen corresponding path program 1 times [2019-10-03 02:50:16,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:16,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:16,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:16,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:16,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:16,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:16,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:50:16,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:16,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:50:16,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:50:16,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:50:16,385 INFO L87 Difference]: Start difference. First operand 26135 states and 42497 transitions. Second operand 8 states. [2019-10-03 02:50:16,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:16,549 INFO L93 Difference]: Finished difference Result 26132 states and 42481 transitions. [2019-10-03 02:50:16,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:50:16,550 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 202 [2019-10-03 02:50:16,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:16,550 INFO L225 Difference]: With dead ends: 26132 [2019-10-03 02:50:16,550 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:50:16,553 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:50:16,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:50:16,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:50:16,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:50:16,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:50:16,554 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 202 [2019-10-03 02:50:16,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:16,554 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:50:16,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:50:16,554 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:50:16,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:50:16,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:50:16 BoogieIcfgContainer [2019-10-03 02:50:16,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:50:16,565 INFO L168 Benchmark]: Toolchain (without parser) took 18908.02 ms. Allocated memory was 133.7 MB in the beginning and 873.5 MB in the end (delta: 739.8 MB). Free memory was 87.7 MB in the beginning and 463.7 MB in the end (delta: -376.0 MB). Peak memory consumption was 363.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:50:16,567 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.8 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:50:16,569 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1244.96 ms. Allocated memory was 133.7 MB in the beginning and 202.4 MB in the end (delta: 68.7 MB). Free memory was 87.5 MB in the beginning and 137.9 MB in the end (delta: -50.4 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. [2019-10-03 02:50:16,575 INFO L168 Benchmark]: Boogie Preprocessor took 244.02 ms. Allocated memory is still 202.4 MB. Free memory was 137.9 MB in the beginning and 129.3 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:50:16,576 INFO L168 Benchmark]: RCFGBuilder took 2249.28 ms. Allocated memory was 202.4 MB in the beginning and 264.2 MB in the end (delta: 61.9 MB). Free memory was 129.3 MB in the beginning and 174.9 MB in the end (delta: -45.6 MB). Peak memory consumption was 88.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:50:16,577 INFO L168 Benchmark]: TraceAbstraction took 15164.88 ms. Allocated memory was 264.2 MB in the beginning and 873.5 MB in the end (delta: 609.2 MB). Free memory was 172.7 MB in the beginning and 463.7 MB in the end (delta: -291.0 MB). Peak memory consumption was 318.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:50:16,591 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.25 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1244.96 ms. Allocated memory was 133.7 MB in the beginning and 202.4 MB in the end (delta: 68.7 MB). Free memory was 87.5 MB in the beginning and 137.9 MB in the end (delta: -50.4 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 244.02 ms. Allocated memory is still 202.4 MB. Free memory was 137.9 MB in the beginning and 129.3 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2249.28 ms. Allocated memory was 202.4 MB in the beginning and 264.2 MB in the end (delta: 61.9 MB). Free memory was 129.3 MB in the beginning and 174.9 MB in the end (delta: -45.6 MB). Peak memory consumption was 88.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15164.88 ms. Allocated memory was 264.2 MB in the beginning and 873.5 MB in the end (delta: 609.2 MB). Free memory was 172.7 MB in the beginning and 463.7 MB in the end (delta: -291.0 MB). Peak memory consumption was 318.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 387]: 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 111 procedures, 743 locations, 1 error locations. SAFE Result, 15.0s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 6.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10687 SDtfs, 3424 SDslu, 38761 SDs, 0 SdLazy, 3280 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26135occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 231 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2896 NumberOfCodeBlocks, 2896 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2881 ConstructedInterpolants, 0 QuantifiedInterpolants, 674997 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 498/498 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...