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_product36.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:38:33,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:38:33,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:38:33,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:38:33,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:38:33,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:38:33,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:38:33,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:38:33,334 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:38:33,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:38:33,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:38:33,337 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:38:33,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:38:33,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:38:33,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:38:33,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:38:33,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:38:33,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:38:33,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:38:33,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:38:33,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:38:33,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:38:33,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:38:33,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:38:33,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:38:33,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:38:33,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:38:33,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:38:33,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:38:33,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:38:33,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:38:33,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:38:33,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:38:33,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:38:33,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:38:33,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:38:33,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:38:33,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:38:33,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:38:33,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:38:33,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:38:33,367 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:38:33,382 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:38:33,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:38:33,383 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:38:33,383 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:38:33,384 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:38:33,384 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:38:33,384 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:38:33,384 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:38:33,384 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:38:33,385 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:38:33,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:38:33,386 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:38:33,386 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:38:33,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:38:33,386 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:38:33,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:38:33,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:38:33,387 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:38:33,387 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:38:33,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:38:33,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:38:33,388 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:38:33,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:38:33,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:38:33,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:38:33,389 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:38:33,389 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:38:33,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:38:33,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:38:33,389 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:38:33,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:38:33,439 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:38:33,443 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:38:33,444 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:38:33,445 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:38:33,446 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product36.cil.c [2019-09-10 02:38:33,529 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adcedd4ca/7c2d20c8ecb943e8b0ee5d3b3d01fefc/FLAG860ccab47 [2019-09-10 02:38:34,109 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:38:34,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product36.cil.c [2019-09-10 02:38:34,145 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adcedd4ca/7c2d20c8ecb943e8b0ee5d3b3d01fefc/FLAG860ccab47 [2019-09-10 02:38:34,345 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adcedd4ca/7c2d20c8ecb943e8b0ee5d3b3d01fefc [2019-09-10 02:38:34,355 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:38:34,356 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:38:34,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:38:34,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:38:34,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:38:34,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:38:34" (1/1) ... [2019-09-10 02:38:34,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d3601f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38:34, skipping insertion in model container [2019-09-10 02:38:34,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:38:34" (1/1) ... [2019-09-10 02:38:34,377 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:38:34,463 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:38:35,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:38:35,161 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:38:35,310 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:38:35,387 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:38:35,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38:35 WrapperNode [2019-09-10 02:38:35,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:38:35,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:38:35,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:38:35,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:38:35,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38:35" (1/1) ... [2019-09-10 02:38:35,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38:35" (1/1) ... [2019-09-10 02:38:35,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38:35" (1/1) ... [2019-09-10 02:38:35,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38:35" (1/1) ... [2019-09-10 02:38:35,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38:35" (1/1) ... [2019-09-10 02:38:35,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38:35" (1/1) ... [2019-09-10 02:38:35,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38:35" (1/1) ... [2019-09-10 02:38:35,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:38:35,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:38:35,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:38:35,604 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:38:35,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:38:35,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:38:35,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:38:35,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:38:35,685 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:38:35,685 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:38:35,685 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:38:35,685 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:38:35,685 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:38:35,686 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:38:35,686 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:38:35,686 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:38:35,687 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:38:35,687 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:38:35,688 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-10 02:38:35,688 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:38:35,688 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-10 02:38:35,688 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-10 02:38:35,689 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-10 02:38:35,689 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-10 02:38:35,689 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-10 02:38:35,689 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-10 02:38:35,689 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-10 02:38:35,690 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-10 02:38:35,690 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-10 02:38:35,690 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-10 02:38:35,690 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-10 02:38:35,690 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-10 02:38:35,690 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-10 02:38:35,690 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-10 02:38:35,691 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-10 02:38:35,691 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-10 02:38:35,691 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-10 02:38:35,691 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-10 02:38:35,691 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-10 02:38:35,692 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-10 02:38:35,692 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-10 02:38:35,692 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-10 02:38:35,692 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-10 02:38:35,692 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-10 02:38:35,692 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-10 02:38:35,693 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-10 02:38:35,693 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-10 02:38:35,693 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-10 02:38:35,693 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-10 02:38:35,693 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-10 02:38:35,694 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-10 02:38:35,694 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-10 02:38:35,694 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-10 02:38:35,694 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-10 02:38:35,694 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-10 02:38:35,694 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-10 02:38:35,695 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-10 02:38:35,695 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Base [2019-09-10 02:38:35,695 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-09-10 02:38:35,695 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-10 02:38:35,695 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-10 02:38:35,696 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-10 02:38:35,696 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-10 02:38:35,696 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-10 02:38:35,696 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-10 02:38:35,696 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-10 02:38:35,696 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-10 02:38:35,697 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-10 02:38:35,697 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-10 02:38:35,697 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-10 02:38:35,697 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-10 02:38:35,697 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-10 02:38:35,698 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-10 02:38:35,698 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-10 02:38:35,698 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-10 02:38:35,698 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-10 02:38:35,698 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-10 02:38:35,698 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-10 02:38:35,699 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-10 02:38:35,699 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-10 02:38:35,699 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-10 02:38:35,699 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-10 02:38:35,699 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-10 02:38:35,700 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-10 02:38:35,700 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-10 02:38:35,700 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-10 02:38:35,700 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-10 02:38:35,700 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-10 02:38:35,700 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-10 02:38:35,701 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-10 02:38:35,701 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2019-09-10 02:38:35,701 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:38:35,701 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-10 02:38:35,701 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-10 02:38:35,702 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-10 02:38:35,702 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-10 02:38:35,702 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-10 02:38:35,702 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:38:35,702 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:38:35,702 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-10 02:38:35,703 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-10 02:38:35,703 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-10 02:38:35,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:38:35,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:38:35,703 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:38:35,704 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:38:35,704 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:38:35,704 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:38:35,704 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:38:35,704 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:38:35,705 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:38:35,705 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:38:35,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:38:35,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:38:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:38:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:38:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:38:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:38:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:38:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:38:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:38:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:38:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:38:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:38:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:38:35,708 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:38:35,708 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-10 02:38:35,708 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:38:35,708 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-10 02:38:35,708 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-10 02:38:35,709 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-10 02:38:35,709 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-10 02:38:35,709 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-10 02:38:35,709 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-10 02:38:35,709 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-10 02:38:35,710 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-10 02:38:35,710 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-10 02:38:35,710 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-10 02:38:35,710 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-10 02:38:35,710 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-10 02:38:35,711 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-10 02:38:35,711 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-10 02:38:35,711 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-10 02:38:35,711 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-10 02:38:35,711 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-10 02:38:35,712 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-10 02:38:35,712 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-10 02:38:35,712 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-10 02:38:35,712 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-10 02:38:35,712 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-10 02:38:35,713 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-10 02:38:35,713 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-10 02:38:35,713 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-10 02:38:35,713 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-10 02:38:35,713 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-10 02:38:35,713 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-10 02:38:35,713 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-10 02:38:35,714 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-10 02:38:35,714 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-10 02:38:35,714 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-10 02:38:35,714 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-10 02:38:35,714 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-10 02:38:35,715 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-10 02:38:35,715 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-10 02:38:35,715 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-10 02:38:35,715 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-10 02:38:35,715 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-10 02:38:35,715 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-10 02:38:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-10 02:38:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-10 02:38:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-10 02:38:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-10 02:38:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-10 02:38:35,717 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-10 02:38:35,717 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-10 02:38:35,717 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-10 02:38:35,717 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-10 02:38:35,717 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-10 02:38:35,717 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-10 02:38:35,718 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-10 02:38:35,718 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-10 02:38:35,718 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Base [2019-09-10 02:38:35,718 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-09-10 02:38:35,718 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2019-09-10 02:38:35,718 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-10 02:38:35,718 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-10 02:38:35,719 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-10 02:38:35,719 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-10 02:38:35,719 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-10 02:38:35,719 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-10 02:38:35,719 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-10 02:38:35,719 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-10 02:38:35,719 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-10 02:38:35,719 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-10 02:38:35,720 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-10 02:38:35,720 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-10 02:38:35,720 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-10 02:38:35,720 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-10 02:38:35,720 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-10 02:38:35,720 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-10 02:38:35,720 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-10 02:38:35,721 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-10 02:38:35,721 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-10 02:38:35,721 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-10 02:38:35,721 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:38:35,721 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-10 02:38:35,721 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-10 02:38:35,721 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-10 02:38:35,721 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-10 02:38:35,722 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:38:35,722 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:38:35,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:38:35,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:38:35,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:38:37,785 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:38:37,785 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-10 02:38:37,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:38:37 BoogieIcfgContainer [2019-09-10 02:38:37,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:38:37,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:38:37,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:38:37,793 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:38:37,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:38:34" (1/3) ... [2019-09-10 02:38:37,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90d24bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:38:37, skipping insertion in model container [2019-09-10 02:38:37,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38:35" (2/3) ... [2019-09-10 02:38:37,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90d24bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:38:37, skipping insertion in model container [2019-09-10 02:38:37,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:38:37" (3/3) ... [2019-09-10 02:38:37,798 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product36.cil.c [2019-09-10 02:38:37,809 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:38:37,821 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:38:37,839 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:38:37,880 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:38:37,880 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:38:37,880 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:38:37,880 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:38:37,880 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:38:37,881 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:38:37,881 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:38:37,881 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:38:37,911 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states. [2019-09-10 02:38:37,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 02:38:37,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:37,935 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:38:37,938 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:37,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:37,945 INFO L82 PathProgramCache]: Analyzing trace with hash -181323665, now seen corresponding path program 1 times [2019-09-10 02:38:37,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:37,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:37,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:37,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:37,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:38,479 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:38:38,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:38,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:38:38,482 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:38,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:38:38,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:38:38,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:38:38,507 INFO L87 Difference]: Start difference. First operand 353 states. Second operand 2 states. [2019-09-10 02:38:38,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:38,553 INFO L93 Difference]: Finished difference Result 343 states and 457 transitions. [2019-09-10 02:38:38,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:38:38,558 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 150 [2019-09-10 02:38:38,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:38,590 INFO L225 Difference]: With dead ends: 343 [2019-09-10 02:38:38,590 INFO L226 Difference]: Without dead ends: 334 [2019-09-10 02:38:38,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:38:38,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-10 02:38:38,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2019-09-10 02:38:38,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-09-10 02:38:38,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 446 transitions. [2019-09-10 02:38:38,674 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 446 transitions. Word has length 150 [2019-09-10 02:38:38,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:38,679 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 446 transitions. [2019-09-10 02:38:38,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:38:38,680 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 446 transitions. [2019-09-10 02:38:38,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 02:38:38,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:38,691 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:38:38,692 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:38,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:38,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1201394716, now seen corresponding path program 1 times [2019-09-10 02:38:38,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:38,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:38,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:38,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:38,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:38,994 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:38:38,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:38,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:38:38,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:39,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:38:39,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:38:39,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:39,002 INFO L87 Difference]: Start difference. First operand 334 states and 446 transitions. Second operand 3 states. [2019-09-10 02:38:39,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:39,071 INFO L93 Difference]: Finished difference Result 337 states and 449 transitions. [2019-09-10 02:38:39,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:38:39,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-09-10 02:38:39,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:39,078 INFO L225 Difference]: With dead ends: 337 [2019-09-10 02:38:39,080 INFO L226 Difference]: Without dead ends: 337 [2019-09-10 02:38:39,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:39,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-10 02:38:39,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 336. [2019-09-10 02:38:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-10 02:38:39,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 448 transitions. [2019-09-10 02:38:39,176 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 448 transitions. Word has length 151 [2019-09-10 02:38:39,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:39,177 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 448 transitions. [2019-09-10 02:38:39,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:38:39,177 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 448 transitions. [2019-09-10 02:38:39,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 02:38:39,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:39,181 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:38:39,182 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:39,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:39,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1898498474, now seen corresponding path program 1 times [2019-09-10 02:38:39,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:39,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:39,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:39,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:39,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:39,411 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 02:38:39,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:39,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:38:39,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:39,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:38:39,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:38:39,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:38:39,413 INFO L87 Difference]: Start difference. First operand 336 states and 448 transitions. Second operand 6 states. [2019-09-10 02:38:39,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:39,971 INFO L93 Difference]: Finished difference Result 632 states and 853 transitions. [2019-09-10 02:38:39,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:38:39,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2019-09-10 02:38:39,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:39,982 INFO L225 Difference]: With dead ends: 632 [2019-09-10 02:38:39,982 INFO L226 Difference]: Without dead ends: 632 [2019-09-10 02:38:39,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:38:39,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-09-10 02:38:40,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 623. [2019-09-10 02:38:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-10 02:38:40,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 845 transitions. [2019-09-10 02:38:40,034 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 845 transitions. Word has length 156 [2019-09-10 02:38:40,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:40,035 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 845 transitions. [2019-09-10 02:38:40,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:38:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 845 transitions. [2019-09-10 02:38:40,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 02:38:40,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:40,039 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:38:40,039 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:40,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:40,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1024196321, now seen corresponding path program 1 times [2019-09-10 02:38:40,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:40,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:40,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:40,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:40,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 02:38:40,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:40,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:38:40,289 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:40,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:38:40,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:38:40,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:38:40,291 INFO L87 Difference]: Start difference. First operand 623 states and 845 transitions. Second operand 9 states. [2019-09-10 02:38:40,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:40,451 INFO L93 Difference]: Finished difference Result 653 states and 884 transitions. [2019-09-10 02:38:40,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:38:40,452 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 157 [2019-09-10 02:38:40,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:40,460 INFO L225 Difference]: With dead ends: 653 [2019-09-10 02:38:40,460 INFO L226 Difference]: Without dead ends: 653 [2019-09-10 02:38:40,461 INFO L628 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-09-10 02:38:40,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-09-10 02:38:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 643. [2019-09-10 02:38:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-09-10 02:38:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 871 transitions. [2019-09-10 02:38:40,515 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 871 transitions. Word has length 157 [2019-09-10 02:38:40,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:40,516 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 871 transitions. [2019-09-10 02:38:40,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:38:40,516 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 871 transitions. [2019-09-10 02:38:40,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 02:38:40,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:40,521 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:38:40,521 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:40,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:40,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1612761881, now seen corresponding path program 1 times [2019-09-10 02:38:40,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:40,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:40,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:40,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:40,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:40,729 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 02:38:40,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:40,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:38:40,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:40,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:38:40,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:38:40,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:38:40,742 INFO L87 Difference]: Start difference. First operand 643 states and 871 transitions. Second operand 6 states. [2019-09-10 02:38:41,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:41,230 INFO L93 Difference]: Finished difference Result 1258 states and 1713 transitions. [2019-09-10 02:38:41,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:38:41,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2019-09-10 02:38:41,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:41,245 INFO L225 Difference]: With dead ends: 1258 [2019-09-10 02:38:41,246 INFO L226 Difference]: Without dead ends: 1258 [2019-09-10 02:38:41,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:38:41,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-09-10 02:38:41,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1237. [2019-09-10 02:38:41,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-09-10 02:38:41,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1693 transitions. [2019-09-10 02:38:41,348 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1693 transitions. Word has length 158 [2019-09-10 02:38:41,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:41,349 INFO L475 AbstractCegarLoop]: Abstraction has 1237 states and 1693 transitions. [2019-09-10 02:38:41,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:38:41,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1693 transitions. [2019-09-10 02:38:41,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 02:38:41,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:41,359 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:38:41,359 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:41,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:41,360 INFO L82 PathProgramCache]: Analyzing trace with hash -318587094, now seen corresponding path program 1 times [2019-09-10 02:38:41,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:41,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:41,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:41,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:41,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 02:38:41,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:41,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:38:41,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:41,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:38:41,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:38:41,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:38:41,633 INFO L87 Difference]: Start difference. First operand 1237 states and 1693 transitions. Second operand 9 states. [2019-09-10 02:38:41,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:41,802 INFO L93 Difference]: Finished difference Result 1297 states and 1771 transitions. [2019-09-10 02:38:41,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:38:41,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 159 [2019-09-10 02:38:41,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:41,810 INFO L225 Difference]: With dead ends: 1297 [2019-09-10 02:38:41,810 INFO L226 Difference]: Without dead ends: 1297 [2019-09-10 02:38:41,811 INFO L628 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-09-10 02:38:41,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2019-09-10 02:38:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1277. [2019-09-10 02:38:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1277 states. [2019-09-10 02:38:41,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1745 transitions. [2019-09-10 02:38:41,884 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1745 transitions. Word has length 159 [2019-09-10 02:38:41,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:41,886 INFO L475 AbstractCegarLoop]: Abstraction has 1277 states and 1745 transitions. [2019-09-10 02:38:41,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:38:41,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1745 transitions. [2019-09-10 02:38:41,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:38:41,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:41,892 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:38:41,892 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:41,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:41,893 INFO L82 PathProgramCache]: Analyzing trace with hash 860819702, now seen corresponding path program 1 times [2019-09-10 02:38:41,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:41,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:41,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:41,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:41,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 02:38:42,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:42,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:38:42,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:42,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:38:42,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:38:42,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:38:42,043 INFO L87 Difference]: Start difference. First operand 1277 states and 1745 transitions. Second operand 6 states. [2019-09-10 02:38:42,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:42,469 INFO L93 Difference]: Finished difference Result 2498 states and 3428 transitions. [2019-09-10 02:38:42,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:38:42,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2019-09-10 02:38:42,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:42,488 INFO L225 Difference]: With dead ends: 2498 [2019-09-10 02:38:42,489 INFO L226 Difference]: Without dead ends: 2314 [2019-09-10 02:38:42,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:38:42,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-09-10 02:38:42,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2281. [2019-09-10 02:38:42,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2019-09-10 02:38:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3161 transitions. [2019-09-10 02:38:42,608 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3161 transitions. Word has length 160 [2019-09-10 02:38:42,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:42,611 INFO L475 AbstractCegarLoop]: Abstraction has 2281 states and 3161 transitions. [2019-09-10 02:38:42,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:38:42,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3161 transitions. [2019-09-10 02:38:42,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 02:38:42,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:42,620 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:38:42,620 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:42,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:42,620 INFO L82 PathProgramCache]: Analyzing trace with hash 498604292, now seen corresponding path program 1 times [2019-09-10 02:38:42,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:42,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:42,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:42,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:42,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:38:42,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:42,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:38:42,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:42,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:38:42,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:38:42,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:42,788 INFO L87 Difference]: Start difference. First operand 2281 states and 3161 transitions. Second operand 3 states. [2019-09-10 02:38:42,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:42,815 INFO L93 Difference]: Finished difference Result 2528 states and 3609 transitions. [2019-09-10 02:38:42,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:38:42,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-10 02:38:42,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:42,833 INFO L225 Difference]: With dead ends: 2528 [2019-09-10 02:38:42,834 INFO L226 Difference]: Without dead ends: 2528 [2019-09-10 02:38:42,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:42,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2019-09-10 02:38:42,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2521. [2019-09-10 02:38:42,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2521 states. [2019-09-10 02:38:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 3602 transitions. [2019-09-10 02:38:42,932 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 3602 transitions. Word has length 170 [2019-09-10 02:38:42,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:42,933 INFO L475 AbstractCegarLoop]: Abstraction has 2521 states and 3602 transitions. [2019-09-10 02:38:42,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:38:42,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 3602 transitions. [2019-09-10 02:38:42,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-10 02:38:42,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:42,941 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:38:42,942 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:42,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:42,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1907924547, now seen corresponding path program 1 times [2019-09-10 02:38:42,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:42,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:42,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:42,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:42,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:43,050 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:38:43,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:43,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:38:43,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:43,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:38:43,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:38:43,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:43,052 INFO L87 Difference]: Start difference. First operand 2521 states and 3602 transitions. Second operand 3 states. [2019-09-10 02:38:43,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:43,083 INFO L93 Difference]: Finished difference Result 2968 states and 4419 transitions. [2019-09-10 02:38:43,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:38:43,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-10 02:38:43,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:43,107 INFO L225 Difference]: With dead ends: 2968 [2019-09-10 02:38:43,108 INFO L226 Difference]: Without dead ends: 2968 [2019-09-10 02:38:43,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:43,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2019-09-10 02:38:43,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2961. [2019-09-10 02:38:43,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2961 states. [2019-09-10 02:38:43,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2961 states to 2961 states and 4412 transitions. [2019-09-10 02:38:43,225 INFO L78 Accepts]: Start accepts. Automaton has 2961 states and 4412 transitions. Word has length 171 [2019-09-10 02:38:43,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:43,225 INFO L475 AbstractCegarLoop]: Abstraction has 2961 states and 4412 transitions. [2019-09-10 02:38:43,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:38:43,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2961 states and 4412 transitions. [2019-09-10 02:38:43,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 02:38:43,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:43,240 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:38:43,241 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:43,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:43,241 INFO L82 PathProgramCache]: Analyzing trace with hash -887774842, now seen corresponding path program 1 times [2019-09-10 02:38:43,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:43,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:43,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:43,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:43,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:43,375 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:38:43,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:43,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:38:43,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:43,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:38:43,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:38:43,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:43,377 INFO L87 Difference]: Start difference. First operand 2961 states and 4412 transitions. Second operand 3 states. [2019-09-10 02:38:43,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:43,411 INFO L93 Difference]: Finished difference Result 3864 states and 6039 transitions. [2019-09-10 02:38:43,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:38:43,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-10 02:38:43,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:43,437 INFO L225 Difference]: With dead ends: 3864 [2019-09-10 02:38:43,438 INFO L226 Difference]: Without dead ends: 3864 [2019-09-10 02:38:43,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:43,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3864 states. [2019-09-10 02:38:43,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3864 to 3857. [2019-09-10 02:38:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3857 states. [2019-09-10 02:38:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3857 states to 3857 states and 6032 transitions. [2019-09-10 02:38:43,677 INFO L78 Accepts]: Start accepts. Automaton has 3857 states and 6032 transitions. Word has length 172 [2019-09-10 02:38:43,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:43,677 INFO L475 AbstractCegarLoop]: Abstraction has 3857 states and 6032 transitions. [2019-09-10 02:38:43,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:38:43,677 INFO L276 IsEmpty]: Start isEmpty. Operand 3857 states and 6032 transitions. [2019-09-10 02:38:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 02:38:43,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:43,691 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:38:43,691 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:43,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:43,692 INFO L82 PathProgramCache]: Analyzing trace with hash 543709501, now seen corresponding path program 1 times [2019-09-10 02:38:43,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:43,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:43,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:43,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:43,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:43,797 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:38:43,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:43,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:38:43,798 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:43,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:38:43,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:38:43,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:43,800 INFO L87 Difference]: Start difference. First operand 3857 states and 6032 transitions. Second operand 3 states. [2019-09-10 02:38:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:43,861 INFO L93 Difference]: Finished difference Result 5624 states and 9183 transitions. [2019-09-10 02:38:43,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:38:43,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-10 02:38:43,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:43,904 INFO L225 Difference]: With dead ends: 5624 [2019-09-10 02:38:43,904 INFO L226 Difference]: Without dead ends: 5624 [2019-09-10 02:38:43,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:43,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5624 states. [2019-09-10 02:38:44,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5624 to 5617. [2019-09-10 02:38:44,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5617 states. [2019-09-10 02:38:44,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5617 states to 5617 states and 9176 transitions. [2019-09-10 02:38:44,149 INFO L78 Accepts]: Start accepts. Automaton has 5617 states and 9176 transitions. Word has length 173 [2019-09-10 02:38:44,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:44,150 INFO L475 AbstractCegarLoop]: Abstraction has 5617 states and 9176 transitions. [2019-09-10 02:38:44,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:38:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 5617 states and 9176 transitions. [2019-09-10 02:38:44,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 02:38:44,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:44,180 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:38:44,182 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:44,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:44,182 INFO L82 PathProgramCache]: Analyzing trace with hash -860751288, now seen corresponding path program 1 times [2019-09-10 02:38:44,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:44,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:44,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:44,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:44,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:44,319 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:38:44,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:44,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:38:44,320 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:44,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:38:44,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:38:44,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:44,322 INFO L87 Difference]: Start difference. First operand 5617 states and 9176 transitions. Second operand 3 states. [2019-09-10 02:38:44,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:44,384 INFO L93 Difference]: Finished difference Result 9080 states and 15279 transitions. [2019-09-10 02:38:44,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:38:44,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-10 02:38:44,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:44,455 INFO L225 Difference]: With dead ends: 9080 [2019-09-10 02:38:44,456 INFO L226 Difference]: Without dead ends: 9080 [2019-09-10 02:38:44,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:44,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9080 states. [2019-09-10 02:38:44,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9080 to 9073. [2019-09-10 02:38:44,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9073 states. [2019-09-10 02:38:44,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9073 states to 9073 states and 15272 transitions. [2019-09-10 02:38:44,758 INFO L78 Accepts]: Start accepts. Automaton has 9073 states and 15272 transitions. Word has length 174 [2019-09-10 02:38:44,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:44,759 INFO L475 AbstractCegarLoop]: Abstraction has 9073 states and 15272 transitions. [2019-09-10 02:38:44,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:38:44,759 INFO L276 IsEmpty]: Start isEmpty. Operand 9073 states and 15272 transitions. [2019-09-10 02:38:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 02:38:44,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:44,795 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:38:44,795 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:44,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:44,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1091720315, now seen corresponding path program 1 times [2019-09-10 02:38:44,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:44,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:44,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:44,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:44,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 02:38:44,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:44,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:38:44,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:44,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:38:44,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:38:44,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:38:44,949 INFO L87 Difference]: Start difference. First operand 9073 states and 15272 transitions. Second operand 8 states. [2019-09-10 02:38:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:45,026 INFO L93 Difference]: Finished difference Result 9070 states and 15263 transitions. [2019-09-10 02:38:45,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:38:45,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2019-09-10 02:38:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:45,028 INFO L225 Difference]: With dead ends: 9070 [2019-09-10 02:38:45,028 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:38:45,028 INFO L628 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-09-10 02:38:45,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:38:45,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:38:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:38:45,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:38:45,029 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2019-09-10 02:38:45,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:45,030 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:38:45,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:38:45,030 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:38:45,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:38:45,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:38:45 BoogieIcfgContainer [2019-09-10 02:38:45,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:38:45,040 INFO L168 Benchmark]: Toolchain (without parser) took 10681.76 ms. Allocated memory was 132.1 MB in the beginning and 514.3 MB in the end (delta: 382.2 MB). Free memory was 85.5 MB in the beginning and 315.8 MB in the end (delta: -230.3 MB). Peak memory consumption was 151.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:38:45,041 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 132.1 MB. Free memory was 106.7 MB in the beginning and 106.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:38:45,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1030.79 ms. Allocated memory was 132.1 MB in the beginning and 198.7 MB in the end (delta: 66.6 MB). Free memory was 85.3 MB in the beginning and 137.2 MB in the end (delta: -51.9 MB). Peak memory consumption was 33.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:38:45,045 INFO L168 Benchmark]: Boogie Preprocessor took 214.09 ms. Allocated memory is still 198.7 MB. Free memory was 137.2 MB in the beginning and 129.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. [2019-09-10 02:38:45,050 INFO L168 Benchmark]: RCFGBuilder took 2184.32 ms. Allocated memory was 198.7 MB in the beginning and 267.9 MB in the end (delta: 69.2 MB). Free memory was 128.3 MB in the beginning and 207.7 MB in the end (delta: -79.4 MB). Peak memory consumption was 90.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:38:45,051 INFO L168 Benchmark]: TraceAbstraction took 7247.37 ms. Allocated memory was 267.9 MB in the beginning and 514.3 MB in the end (delta: 246.4 MB). Free memory was 207.7 MB in the beginning and 315.8 MB in the end (delta: -108.1 MB). Peak memory consumption was 138.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:38:45,064 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 132.1 MB. Free memory was 106.7 MB in the beginning and 106.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1030.79 ms. Allocated memory was 132.1 MB in the beginning and 198.7 MB in the end (delta: 66.6 MB). Free memory was 85.3 MB in the beginning and 137.2 MB in the end (delta: -51.9 MB). Peak memory consumption was 33.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 214.09 ms. Allocated memory is still 198.7 MB. Free memory was 137.2 MB in the beginning and 129.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2184.32 ms. Allocated memory was 198.7 MB in the beginning and 267.9 MB in the end (delta: 69.2 MB). Free memory was 128.3 MB in the beginning and 207.7 MB in the end (delta: -79.4 MB). Peak memory consumption was 90.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7247.37 ms. Allocated memory was 267.9 MB in the beginning and 514.3 MB in the end (delta: 246.4 MB). Free memory was 207.7 MB in the beginning and 315.8 MB in the end (delta: -108.1 MB). Peak memory consumption was 138.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 476]: 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 97 procedures, 652 locations, 1 error locations. SAFE Result, 7.1s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5966 SDtfs, 1486 SDslu, 16629 SDs, 0 SdLazy, 764 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9073occurred in iteration=12, 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: 1.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 129 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2126 NumberOfCodeBlocks, 2126 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2113 ConstructedInterpolants, 0 QuantifiedInterpolants, 416539 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 282/282 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...