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_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:48:55,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:48:55,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:48:55,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:48:55,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:48:55,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:48:55,790 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:48:55,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:48:55,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:48:55,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:48:55,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:48:55,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:48:55,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:48:55,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:48:55,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:48:55,800 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:48:55,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:48:55,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:48:55,803 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:48:55,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:48:55,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:48:55,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:48:55,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:48:55,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:48:55,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:48:55,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:48:55,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:48:55,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:48:55,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:48:55,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:48:55,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:48:55,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:48:55,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:48:55,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:48:55,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:48:55,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:48:55,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:48:55,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:48:55,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:48:55,829 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:48:55,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:48:55,832 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:48:55,855 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:48:55,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:48:55,856 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:48:55,857 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:48:55,857 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:48:55,858 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:48:55,858 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:48:55,858 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:48:55,858 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:48:55,858 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:48:55,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:48:55,861 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:48:55,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:48:55,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:48:55,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:48:55,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:48:55,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:48:55,863 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:48:55,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:48:55,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:48:55,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:48:55,864 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:48:55,864 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:48:55,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:48:55,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:48:55,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:48:55,865 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:48:55,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:48:55,865 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:48:55,865 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:48:55,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:48:55,939 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:48:55,942 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:48:55,943 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:48:55,944 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:48:55,945 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product26.cil.c [2019-10-03 02:48:56,008 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42ebda15b/7c8383affe214a35a13575eaed5db433/FLAGb09dd5ab4 [2019-10-03 02:48:56,597 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:48:56,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product26.cil.c [2019-10-03 02:48:56,620 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42ebda15b/7c8383affe214a35a13575eaed5db433/FLAGb09dd5ab4 [2019-10-03 02:48:56,825 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42ebda15b/7c8383affe214a35a13575eaed5db433 [2019-10-03 02:48:56,836 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:48:56,838 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:48:56,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:48:56,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:48:56,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:48:56,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:48:56" (1/1) ... [2019-10-03 02:48:56,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c1c88cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:48:56, skipping insertion in model container [2019-10-03 02:48:56,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:48:56" (1/1) ... [2019-10-03 02:48:56,856 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:48:56,958 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:48:57,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:48:57,922 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:48:58,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:48:58,229 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:48:58,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:48:58 WrapperNode [2019-10-03 02:48:58,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:48:58,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:48:58,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:48:58,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:48:58,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:48:58" (1/1) ... [2019-10-03 02:48:58,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:48:58" (1/1) ... [2019-10-03 02:48:58,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:48:58" (1/1) ... [2019-10-03 02:48:58,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:48:58" (1/1) ... [2019-10-03 02:48:58,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:48:58" (1/1) ... [2019-10-03 02:48:58,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:48:58" (1/1) ... [2019-10-03 02:48:58,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:48:58" (1/1) ... [2019-10-03 02:48:58,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:48:58,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:48:58,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:48:58,434 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:48:58,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:48:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:48:58,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:48:58,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:48:58,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:48:58,522 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:48:58,522 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-03 02:48:58,522 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:48:58,522 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:48:58,523 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:48:58,523 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-03 02:48:58,523 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-03 02:48:58,524 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-03 02:48:58,524 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:48:58,525 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:48:58,525 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:48:58,526 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:48:58,526 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:48:58,527 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:48:58,527 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:48:58,527 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:48:58,527 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:48:58,528 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-03 02:48:58,528 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-03 02:48:58,528 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-03 02:48:58,528 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:48:58,529 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:48:58,529 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:48:58,529 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:48:58,529 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:48:58,529 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:48:58,530 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:48:58,530 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:48:58,530 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:48:58,530 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:48:58,530 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:48:58,530 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:48:58,530 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:48:58,530 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:48:58,531 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:48:58,531 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:48:58,531 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:48:58,531 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:48:58,532 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:48:58,532 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:48:58,532 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:48:58,532 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-03 02:48:58,532 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:48:58,532 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-03 02:48:58,532 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:48:58,533 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-03 02:48:58,533 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:48:58,533 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:48:58,533 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:48:58,533 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:48:58,533 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:48:58,533 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:48:58,534 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:48:58,534 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:48:58,534 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:48:58,534 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:48:58,535 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:48:58,535 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:48:58,535 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:48:58,535 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:48:58,535 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-03 02:48:58,536 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-03 02:48:58,536 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-03 02:48:58,536 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:48:58,536 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-03 02:48:58,536 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:48:58,536 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-03 02:48:58,537 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:48:58,537 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:48:58,537 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:48:58,538 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:48:58,538 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:48:58,538 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:48:58,538 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:48:58,539 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:48:58,539 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:48:58,540 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:48:58,540 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:48:58,540 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:48:58,540 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:48:58,540 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:48:58,540 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:48:58,541 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:48:58,542 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:48:58,542 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:48:58,542 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:48:58,543 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:48:58,543 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:48:58,543 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:48:58,543 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:48:58,543 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:48:58,543 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:48:58,543 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:48:58,544 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:48:58,544 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:48:58,544 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:48:58,544 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:48:58,544 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:48:58,544 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:48:58,544 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:48:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:48:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:48:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:48:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2019-10-03 02:48:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:48:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:48:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:48:58,546 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:48:58,546 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:48:58,546 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:48:58,546 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:48:58,547 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:48:58,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:48:58,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:48:58,548 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:48:58,548 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:48:58,548 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:48:58,549 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:48:58,549 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:48:58,549 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:48:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:48:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:48:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:48:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:48:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:48:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:48:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:48:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:48:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:48:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:48:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:48:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:48:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:48:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:48:58,556 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:48:58,556 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:48:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:48:58,561 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:48:58,561 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:48:58,561 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:48:58,567 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:48:58,567 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:48:58,567 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:48:58,567 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:48:58,567 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:48:58,567 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:48:58,568 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:48:58,568 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-03 02:48:58,568 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-03 02:48:58,568 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-03 02:48:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:48:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-03 02:48:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:48:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-03 02:48:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-03 02:48:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-03 02:48:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2019-10-03 02:48:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:48:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:48:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:48:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:48:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:48:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:48:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:48:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:48:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:48:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:48:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:48:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:48:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:48:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:48:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:48:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:48:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:48:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:48:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:48:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:48:58,573 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:48:58,573 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:48:58,573 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:48:58,573 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:48:58,573 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:48:58,573 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:48:58,573 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:48:58,574 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:48:58,574 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:48:58,574 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:48:58,574 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:48:58,574 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:48:58,574 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:48:58,574 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:48:58,574 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:48:58,574 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:48:58,575 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:48:58,575 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:48:58,575 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:48:58,575 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:48:58,575 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:48:58,575 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:48:58,576 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:48:58,576 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:48:58,576 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-03 02:48:58,576 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-03 02:48:58,576 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-03 02:48:58,576 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-03 02:48:58,576 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-03 02:48:58,577 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-03 02:48:58,577 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:48:58,577 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:48:58,577 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-03 02:48:58,577 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-03 02:48:58,577 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:48:58,578 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:48:58,578 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:48:58,578 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:48:58,578 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:48:58,578 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:48:58,578 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:48:58,578 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:48:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:48:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:48:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:48:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:48:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:48:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:48:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:48:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:48:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:48:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:48:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:48:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:48:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:48:58,581 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:48:58,581 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:48:58,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:48:58,581 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:48:58,581 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:48:58,581 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:48:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:48:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:48:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:48:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:49:00,845 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:49:00,845 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:49:00,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:49:00 BoogieIcfgContainer [2019-10-03 02:49:00,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:49:00,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:49:00,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:49:00,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:49:00,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:48:56" (1/3) ... [2019-10-03 02:49:00,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5627bd85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:49:00, skipping insertion in model container [2019-10-03 02:49:00,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:48:58" (2/3) ... [2019-10-03 02:49:00,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5627bd85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:49:00, skipping insertion in model container [2019-10-03 02:49:00,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:49:00" (3/3) ... [2019-10-03 02:49:00,859 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product26.cil.c [2019-10-03 02:49:00,870 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:49:00,887 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:49:00,906 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:49:00,940 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:49:00,940 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:49:00,940 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:49:00,941 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:49:00,943 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:49:00,949 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:49:00,949 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:49:00,949 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:49:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states. [2019-10-03 02:49:01,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-03 02:49:01,026 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:01,027 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:01,030 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:01,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:01,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1050293999, now seen corresponding path program 1 times [2019-10-03 02:49:01,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:01,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:01,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:01,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:01,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:01,800 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:49:01,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:01,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:49:01,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:01,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:49:01,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:49:01,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:49:01,829 INFO L87 Difference]: Start difference. First operand 598 states. Second operand 2 states. [2019-10-03 02:49:01,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:01,900 INFO L93 Difference]: Finished difference Result 578 states and 786 transitions. [2019-10-03 02:49:01,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:49:01,906 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 209 [2019-10-03 02:49:01,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:01,932 INFO L225 Difference]: With dead ends: 578 [2019-10-03 02:49:01,933 INFO L226 Difference]: Without dead ends: 569 [2019-10-03 02:49:01,935 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:49:01,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-03 02:49:02,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-03 02:49:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-03 02:49:02,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 775 transitions. [2019-10-03 02:49:02,038 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 775 transitions. Word has length 209 [2019-10-03 02:49:02,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:02,044 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 775 transitions. [2019-10-03 02:49:02,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:49:02,044 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 775 transitions. [2019-10-03 02:49:02,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-03 02:49:02,058 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:02,059 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:02,060 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:02,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:02,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1566712798, now seen corresponding path program 1 times [2019-10-03 02:49:02,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:02,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:02,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:02,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:02,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:49:02,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:02,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:49:02,430 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:02,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:49:02,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:49:02,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:49:02,438 INFO L87 Difference]: Start difference. First operand 569 states and 775 transitions. Second operand 3 states. [2019-10-03 02:49:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:02,520 INFO L93 Difference]: Finished difference Result 572 states and 778 transitions. [2019-10-03 02:49:02,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:49:02,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-10-03 02:49:02,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:02,540 INFO L225 Difference]: With dead ends: 572 [2019-10-03 02:49:02,540 INFO L226 Difference]: Without dead ends: 572 [2019-10-03 02:49:02,541 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:49:02,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-10-03 02:49:02,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 571. [2019-10-03 02:49:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-03 02:49:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 777 transitions. [2019-10-03 02:49:02,607 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 777 transitions. Word has length 210 [2019-10-03 02:49:02,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:02,610 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 777 transitions. [2019-10-03 02:49:02,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:49:02,610 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 777 transitions. [2019-10-03 02:49:02,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-03 02:49:02,624 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:02,625 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:02,625 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:02,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:02,626 INFO L82 PathProgramCache]: Analyzing trace with hash 641729421, now seen corresponding path program 1 times [2019-10-03 02:49:02,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:02,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:02,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:02,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:02,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:02,981 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:49:02,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:02,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:49:02,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:02,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:49:02,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:49:02,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:49:02,983 INFO L87 Difference]: Start difference. First operand 571 states and 777 transitions. Second operand 3 states. [2019-10-03 02:49:03,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:03,042 INFO L93 Difference]: Finished difference Result 616 states and 853 transitions. [2019-10-03 02:49:03,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:49:03,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-10-03 02:49:03,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:03,052 INFO L225 Difference]: With dead ends: 616 [2019-10-03 02:49:03,052 INFO L226 Difference]: Without dead ends: 616 [2019-10-03 02:49:03,053 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:49:03,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-10-03 02:49:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 615. [2019-10-03 02:49:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-10-03 02:49:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 852 transitions. [2019-10-03 02:49:03,103 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 852 transitions. Word has length 222 [2019-10-03 02:49:03,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:03,106 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 852 transitions. [2019-10-03 02:49:03,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:49:03,107 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 852 transitions. [2019-10-03 02:49:03,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-03 02:49:03,119 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:03,119 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:03,120 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:03,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:03,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1183894692, now seen corresponding path program 1 times [2019-10-03 02:49:03,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:03,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:03,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:03,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:03,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:03,392 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:49:03,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:03,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:49:03,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:03,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:49:03,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:49:03,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:49:03,397 INFO L87 Difference]: Start difference. First operand 615 states and 852 transitions. Second operand 3 states. [2019-10-03 02:49:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:03,429 INFO L93 Difference]: Finished difference Result 701 states and 997 transitions. [2019-10-03 02:49:03,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:49:03,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-10-03 02:49:03,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:03,437 INFO L225 Difference]: With dead ends: 701 [2019-10-03 02:49:03,438 INFO L226 Difference]: Without dead ends: 701 [2019-10-03 02:49:03,438 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:49:03,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-10-03 02:49:03,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 700. [2019-10-03 02:49:03,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-10-03 02:49:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 996 transitions. [2019-10-03 02:49:03,477 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 996 transitions. Word has length 223 [2019-10-03 02:49:03,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:03,478 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 996 transitions. [2019-10-03 02:49:03,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:49:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 996 transitions. [2019-10-03 02:49:03,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-03 02:49:03,488 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:03,488 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:03,489 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:03,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:03,489 INFO L82 PathProgramCache]: Analyzing trace with hash -577752831, now seen corresponding path program 1 times [2019-10-03 02:49:03,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:03,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:03,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:03,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:03,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:49:04,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:04,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 02:49:04,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:04,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 02:49:04,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 02:49:04,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:49:04,273 INFO L87 Difference]: Start difference. First operand 700 states and 996 transitions. Second operand 19 states. [2019-10-03 02:49:10,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:10,251 INFO L93 Difference]: Finished difference Result 1971 states and 2820 transitions. [2019-10-03 02:49:10,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-03 02:49:10,252 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 226 [2019-10-03 02:49:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:10,268 INFO L225 Difference]: With dead ends: 1971 [2019-10-03 02:49:10,268 INFO L226 Difference]: Without dead ends: 1971 [2019-10-03 02:49:10,270 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-03 02:49:10,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2019-10-03 02:49:10,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1934. [2019-10-03 02:49:10,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2019-10-03 02:49:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 2772 transitions. [2019-10-03 02:49:10,359 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 2772 transitions. Word has length 226 [2019-10-03 02:49:10,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:10,360 INFO L475 AbstractCegarLoop]: Abstraction has 1934 states and 2772 transitions. [2019-10-03 02:49:10,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 02:49:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2772 transitions. [2019-10-03 02:49:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-03 02:49:10,368 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:10,369 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:10,369 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:10,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:10,369 INFO L82 PathProgramCache]: Analyzing trace with hash 893920590, now seen corresponding path program 1 times [2019-10-03 02:49:10,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:10,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:10,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:10,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:10,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:49:10,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:10,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:49:10,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:10,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:49:10,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:49:10,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:49:10,663 INFO L87 Difference]: Start difference. First operand 1934 states and 2772 transitions. Second operand 11 states. [2019-10-03 02:49:11,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:11,106 INFO L93 Difference]: Finished difference Result 2064 states and 2987 transitions. [2019-10-03 02:49:11,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:49:11,106 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 227 [2019-10-03 02:49:11,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:11,119 INFO L225 Difference]: With dead ends: 2064 [2019-10-03 02:49:11,119 INFO L226 Difference]: Without dead ends: 2056 [2019-10-03 02:49:11,120 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:49:11,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2019-10-03 02:49:11,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 2056. [2019-10-03 02:49:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-10-03 02:49:11,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2969 transitions. [2019-10-03 02:49:11,193 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2969 transitions. Word has length 227 [2019-10-03 02:49:11,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:11,193 INFO L475 AbstractCegarLoop]: Abstraction has 2056 states and 2969 transitions. [2019-10-03 02:49:11,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:49:11,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2969 transitions. [2019-10-03 02:49:11,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-03 02:49:11,202 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:11,202 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:11,203 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:11,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:11,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1022222007, now seen corresponding path program 1 times [2019-10-03 02:49:11,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:11,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:11,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:11,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:11,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:49:11,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:11,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:49:11,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:11,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:49:11,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:49:11,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:49:11,556 INFO L87 Difference]: Start difference. First operand 2056 states and 2969 transitions. Second operand 15 states. [2019-10-03 02:49:15,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:15,248 INFO L93 Difference]: Finished difference Result 2174 states and 3155 transitions. [2019-10-03 02:49:15,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-03 02:49:15,248 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 227 [2019-10-03 02:49:15,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:15,261 INFO L225 Difference]: With dead ends: 2174 [2019-10-03 02:49:15,261 INFO L226 Difference]: Without dead ends: 2174 [2019-10-03 02:49:15,263 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-03 02:49:15,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2019-10-03 02:49:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2137. [2019-10-03 02:49:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2137 states. [2019-10-03 02:49:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3106 transitions. [2019-10-03 02:49:15,342 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3106 transitions. Word has length 227 [2019-10-03 02:49:15,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:15,343 INFO L475 AbstractCegarLoop]: Abstraction has 2137 states and 3106 transitions. [2019-10-03 02:49:15,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:49:15,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3106 transitions. [2019-10-03 02:49:15,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-03 02:49:15,352 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:15,353 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:15,353 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:15,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:15,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1553480520, now seen corresponding path program 1 times [2019-10-03 02:49:15,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:15,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:15,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:15,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:15,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:15,729 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 02:49:15,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:15,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-03 02:49:15,730 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:15,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-03 02:49:15,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-03 02:49:15,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:49:15,732 INFO L87 Difference]: Start difference. First operand 2137 states and 3106 transitions. Second operand 16 states. [2019-10-03 02:49:16,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:16,203 INFO L93 Difference]: Finished difference Result 2184 states and 3149 transitions. [2019-10-03 02:49:16,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-03 02:49:16,204 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 227 [2019-10-03 02:49:16,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:16,225 INFO L225 Difference]: With dead ends: 2184 [2019-10-03 02:49:16,225 INFO L226 Difference]: Without dead ends: 2184 [2019-10-03 02:49:16,226 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-10-03 02:49:16,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2019-10-03 02:49:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2182. [2019-10-03 02:49:16,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2182 states. [2019-10-03 02:49:16,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 3147 transitions. [2019-10-03 02:49:16,306 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 3147 transitions. Word has length 227 [2019-10-03 02:49:16,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:16,307 INFO L475 AbstractCegarLoop]: Abstraction has 2182 states and 3147 transitions. [2019-10-03 02:49:16,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-03 02:49:16,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 3147 transitions. [2019-10-03 02:49:16,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-03 02:49:16,321 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:16,322 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:16,322 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:16,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:16,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1111356124, now seen corresponding path program 1 times [2019-10-03 02:49:16,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:16,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:16,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:16,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:16,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:16,616 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:49:16,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:16,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:49:16,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:16,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:49:16,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:49:16,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:49:16,619 INFO L87 Difference]: Start difference. First operand 2182 states and 3147 transitions. Second operand 5 states. [2019-10-03 02:49:17,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:17,716 INFO L93 Difference]: Finished difference Result 4583 states and 6570 transitions. [2019-10-03 02:49:17,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:49:17,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 227 [2019-10-03 02:49:17,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:17,744 INFO L225 Difference]: With dead ends: 4583 [2019-10-03 02:49:17,744 INFO L226 Difference]: Without dead ends: 4583 [2019-10-03 02:49:17,744 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:49:17,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2019-10-03 02:49:17,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 4569. [2019-10-03 02:49:17,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4569 states. [2019-10-03 02:49:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4569 states to 4569 states and 6556 transitions. [2019-10-03 02:49:17,895 INFO L78 Accepts]: Start accepts. Automaton has 4569 states and 6556 transitions. Word has length 227 [2019-10-03 02:49:17,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:17,895 INFO L475 AbstractCegarLoop]: Abstraction has 4569 states and 6556 transitions. [2019-10-03 02:49:17,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:49:17,895 INFO L276 IsEmpty]: Start isEmpty. Operand 4569 states and 6556 transitions. [2019-10-03 02:49:17,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-03 02:49:17,907 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:17,908 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:17,908 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:17,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:17,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1329265635, now seen corresponding path program 1 times [2019-10-03 02:49:17,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:17,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:17,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:17,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:17,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:49:18,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:18,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-03 02:49:18,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:18,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 02:49:18,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 02:49:18,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:49:18,228 INFO L87 Difference]: Start difference. First operand 4569 states and 6556 transitions. Second operand 13 states. [2019-10-03 02:49:21,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:21,360 INFO L93 Difference]: Finished difference Result 9209 states and 13201 transitions. [2019-10-03 02:49:21,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 02:49:21,363 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 227 [2019-10-03 02:49:21,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:21,420 INFO L225 Difference]: With dead ends: 9209 [2019-10-03 02:49:21,421 INFO L226 Difference]: Without dead ends: 9209 [2019-10-03 02:49:21,421 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-10-03 02:49:21,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9209 states. [2019-10-03 02:49:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9209 to 9166. [2019-10-03 02:49:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9166 states. [2019-10-03 02:49:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9166 states to 9166 states and 13139 transitions. [2019-10-03 02:49:21,904 INFO L78 Accepts]: Start accepts. Automaton has 9166 states and 13139 transitions. Word has length 227 [2019-10-03 02:49:21,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:21,908 INFO L475 AbstractCegarLoop]: Abstraction has 9166 states and 13139 transitions. [2019-10-03 02:49:21,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 02:49:21,908 INFO L276 IsEmpty]: Start isEmpty. Operand 9166 states and 13139 transitions. [2019-10-03 02:49:21,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-03 02:49:21,934 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:21,934 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:21,934 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:21,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:21,935 INFO L82 PathProgramCache]: Analyzing trace with hash 423873233, now seen corresponding path program 1 times [2019-10-03 02:49:21,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:21,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:21,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:21,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:21,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:22,088 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:49:22,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:22,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:49:22,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:22,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:49:22,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:49:22,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:49:22,090 INFO L87 Difference]: Start difference. First operand 9166 states and 13139 transitions. Second operand 3 states. [2019-10-03 02:49:22,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:22,150 INFO L93 Difference]: Finished difference Result 10156 states and 14915 transitions. [2019-10-03 02:49:22,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:49:22,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-10-03 02:49:22,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:22,222 INFO L225 Difference]: With dead ends: 10156 [2019-10-03 02:49:22,222 INFO L226 Difference]: Without dead ends: 10156 [2019-10-03 02:49:22,223 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:49:22,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10156 states. [2019-10-03 02:49:22,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10156 to 10150. [2019-10-03 02:49:22,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10150 states. [2019-10-03 02:49:22,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10150 states to 10150 states and 14909 transitions. [2019-10-03 02:49:22,528 INFO L78 Accepts]: Start accepts. Automaton has 10150 states and 14909 transitions. Word has length 225 [2019-10-03 02:49:22,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:22,528 INFO L475 AbstractCegarLoop]: Abstraction has 10150 states and 14909 transitions. [2019-10-03 02:49:22,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:49:22,529 INFO L276 IsEmpty]: Start isEmpty. Operand 10150 states and 14909 transitions. [2019-10-03 02:49:22,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-03 02:49:22,557 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:22,557 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:22,558 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:22,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:22,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1720613858, now seen corresponding path program 1 times [2019-10-03 02:49:22,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:22,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:22,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:22,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:22,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:22,780 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:49:22,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:22,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:49:22,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:22,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:49:22,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:49:22,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:49:22,783 INFO L87 Difference]: Start difference. First operand 10150 states and 14909 transitions. Second operand 11 states. [2019-10-03 02:49:23,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:23,153 INFO L93 Difference]: Finished difference Result 10870 states and 16054 transitions. [2019-10-03 02:49:23,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:49:23,154 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 228 [2019-10-03 02:49:23,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:23,201 INFO L225 Difference]: With dead ends: 10870 [2019-10-03 02:49:23,202 INFO L226 Difference]: Without dead ends: 10870 [2019-10-03 02:49:23,203 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:49:23,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10870 states. [2019-10-03 02:49:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10870 to 10790. [2019-10-03 02:49:23,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10790 states. [2019-10-03 02:49:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10790 states to 10790 states and 15954 transitions. [2019-10-03 02:49:23,600 INFO L78 Accepts]: Start accepts. Automaton has 10790 states and 15954 transitions. Word has length 228 [2019-10-03 02:49:23,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:23,601 INFO L475 AbstractCegarLoop]: Abstraction has 10790 states and 15954 transitions. [2019-10-03 02:49:23,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:49:23,602 INFO L276 IsEmpty]: Start isEmpty. Operand 10790 states and 15954 transitions. [2019-10-03 02:49:23,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-03 02:49:23,642 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:23,642 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:23,643 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:23,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:23,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1999732818, now seen corresponding path program 1 times [2019-10-03 02:49:23,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:23,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:23,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:23,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:23,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:49:23,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:23,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:49:23,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:23,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:49:23,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:49:23,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:49:23,892 INFO L87 Difference]: Start difference. First operand 10790 states and 15954 transitions. Second operand 9 states. [2019-10-03 02:49:24,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:24,097 INFO L93 Difference]: Finished difference Result 10910 states and 16094 transitions. [2019-10-03 02:49:24,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:49:24,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 229 [2019-10-03 02:49:24,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:24,161 INFO L225 Difference]: With dead ends: 10910 [2019-10-03 02:49:24,162 INFO L226 Difference]: Without dead ends: 10910 [2019-10-03 02:49:24,162 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:49:24,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10910 states. [2019-10-03 02:49:24,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10910 to 10830. [2019-10-03 02:49:24,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10830 states. [2019-10-03 02:49:24,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10830 states to 10830 states and 15994 transitions. [2019-10-03 02:49:24,499 INFO L78 Accepts]: Start accepts. Automaton has 10830 states and 15994 transitions. Word has length 229 [2019-10-03 02:49:24,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:24,500 INFO L475 AbstractCegarLoop]: Abstraction has 10830 states and 15994 transitions. [2019-10-03 02:49:24,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:49:24,501 INFO L276 IsEmpty]: Start isEmpty. Operand 10830 states and 15994 transitions. [2019-10-03 02:49:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-03 02:49:24,536 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:24,536 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:24,537 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:24,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:24,537 INFO L82 PathProgramCache]: Analyzing trace with hash 41914732, now seen corresponding path program 1 times [2019-10-03 02:49:24,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:24,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:24,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:24,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:24,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:49:24,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:24,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:49:24,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:24,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:49:24,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:49:24,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:49:24,935 INFO L87 Difference]: Start difference. First operand 10830 states and 15994 transitions. Second operand 6 states. [2019-10-03 02:49:25,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:25,685 INFO L93 Difference]: Finished difference Result 21875 states and 32409 transitions. [2019-10-03 02:49:25,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:49:25,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 228 [2019-10-03 02:49:25,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:25,796 INFO L225 Difference]: With dead ends: 21875 [2019-10-03 02:49:25,796 INFO L226 Difference]: Without dead ends: 21875 [2019-10-03 02:49:25,797 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:49:25,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21875 states. [2019-10-03 02:49:26,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21875 to 21732. [2019-10-03 02:49:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21732 states. [2019-10-03 02:49:26,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21732 states to 21732 states and 32127 transitions. [2019-10-03 02:49:26,477 INFO L78 Accepts]: Start accepts. Automaton has 21732 states and 32127 transitions. Word has length 228 [2019-10-03 02:49:26,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:26,478 INFO L475 AbstractCegarLoop]: Abstraction has 21732 states and 32127 transitions. [2019-10-03 02:49:26,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:49:26,478 INFO L276 IsEmpty]: Start isEmpty. Operand 21732 states and 32127 transitions. [2019-10-03 02:49:26,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-03 02:49:26,515 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:26,515 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:26,516 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:26,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:26,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1101915101, now seen corresponding path program 1 times [2019-10-03 02:49:26,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:26,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:26,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:26,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:26,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:27,439 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:49:27,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:27,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:49:27,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:27,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:49:27,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:49:27,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:49:27,441 INFO L87 Difference]: Start difference. First operand 21732 states and 32127 transitions. Second operand 6 states. [2019-10-03 02:49:28,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:28,230 INFO L93 Difference]: Finished difference Result 44039 states and 65289 transitions. [2019-10-03 02:49:28,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:49:28,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2019-10-03 02:49:28,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:28,458 INFO L225 Difference]: With dead ends: 44039 [2019-10-03 02:49:28,459 INFO L226 Difference]: Without dead ends: 44039 [2019-10-03 02:49:28,460 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:49:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44039 states. [2019-10-03 02:49:29,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44039 to 43516. [2019-10-03 02:49:29,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43516 states. [2019-10-03 02:49:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43516 states to 43516 states and 64427 transitions. [2019-10-03 02:49:29,768 INFO L78 Accepts]: Start accepts. Automaton has 43516 states and 64427 transitions. Word has length 230 [2019-10-03 02:49:29,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:29,768 INFO L475 AbstractCegarLoop]: Abstraction has 43516 states and 64427 transitions. [2019-10-03 02:49:29,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:49:29,768 INFO L276 IsEmpty]: Start isEmpty. Operand 43516 states and 64427 transitions. [2019-10-03 02:49:29,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-03 02:49:29,853 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:29,854 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:29,854 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:29,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:29,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1811776438, now seen corresponding path program 1 times [2019-10-03 02:49:29,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:29,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:29,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:29,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:29,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:30,036 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:49:30,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:30,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:49:30,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:30,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:49:30,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:49:30,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:49:30,040 INFO L87 Difference]: Start difference. First operand 43516 states and 64427 transitions. Second operand 9 states. [2019-10-03 02:49:30,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:30,357 INFO L93 Difference]: Finished difference Result 45596 states and 67807 transitions. [2019-10-03 02:49:30,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:49:30,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 231 [2019-10-03 02:49:30,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:30,559 INFO L225 Difference]: With dead ends: 45596 [2019-10-03 02:49:30,560 INFO L226 Difference]: Without dead ends: 45596 [2019-10-03 02:49:30,560 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:49:30,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45596 states. [2019-10-03 02:49:32,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45596 to 45436. [2019-10-03 02:49:32,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45436 states. [2019-10-03 02:49:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45436 states to 45436 states and 67567 transitions. [2019-10-03 02:49:32,839 INFO L78 Accepts]: Start accepts. Automaton has 45436 states and 67567 transitions. Word has length 231 [2019-10-03 02:49:32,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:32,839 INFO L475 AbstractCegarLoop]: Abstraction has 45436 states and 67567 transitions. [2019-10-03 02:49:32,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:49:32,840 INFO L276 IsEmpty]: Start isEmpty. Operand 45436 states and 67567 transitions. [2019-10-03 02:49:32,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-03 02:49:32,898 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:32,899 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:32,899 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:32,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:32,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1903290686, now seen corresponding path program 1 times [2019-10-03 02:49:32,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:32,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:32,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:32,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:32,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:33,332 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:49:33,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:33,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:49:33,333 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:33,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:49:33,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:49:33,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:49:33,334 INFO L87 Difference]: Start difference. First operand 45436 states and 67567 transitions. Second operand 11 states. [2019-10-03 02:49:33,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:33,770 INFO L93 Difference]: Finished difference Result 46196 states and 68647 transitions. [2019-10-03 02:49:33,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:49:33,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 232 [2019-10-03 02:49:33,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:33,880 INFO L225 Difference]: With dead ends: 46196 [2019-10-03 02:49:33,880 INFO L226 Difference]: Without dead ends: 46196 [2019-10-03 02:49:33,881 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:49:33,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46196 states. [2019-10-03 02:49:35,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46196 to 46036. [2019-10-03 02:49:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46036 states. [2019-10-03 02:49:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46036 states to 46036 states and 68407 transitions. [2019-10-03 02:49:35,122 INFO L78 Accepts]: Start accepts. Automaton has 46036 states and 68407 transitions. Word has length 232 [2019-10-03 02:49:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:35,122 INFO L475 AbstractCegarLoop]: Abstraction has 46036 states and 68407 transitions. [2019-10-03 02:49:35,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:49:35,123 INFO L276 IsEmpty]: Start isEmpty. Operand 46036 states and 68407 transitions. [2019-10-03 02:49:35,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-03 02:49:35,164 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:35,164 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:35,164 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:35,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:35,165 INFO L82 PathProgramCache]: Analyzing trace with hash -179506284, now seen corresponding path program 1 times [2019-10-03 02:49:35,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:35,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:35,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:35,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:35,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:35,383 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:49:35,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:35,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:49:35,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:35,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:49:35,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:49:35,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:49:35,385 INFO L87 Difference]: Start difference. First operand 46036 states and 68407 transitions. Second operand 11 states. [2019-10-03 02:49:35,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:35,753 INFO L93 Difference]: Finished difference Result 46356 states and 68607 transitions. [2019-10-03 02:49:35,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:49:35,753 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 232 [2019-10-03 02:49:35,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:35,861 INFO L225 Difference]: With dead ends: 46356 [2019-10-03 02:49:35,861 INFO L226 Difference]: Without dead ends: 46356 [2019-10-03 02:49:35,862 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:49:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46356 states. [2019-10-03 02:49:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46356 to 46036. [2019-10-03 02:49:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46036 states. [2019-10-03 02:49:38,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46036 states to 46036 states and 68207 transitions. [2019-10-03 02:49:38,227 INFO L78 Accepts]: Start accepts. Automaton has 46036 states and 68207 transitions. Word has length 232 [2019-10-03 02:49:38,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:38,228 INFO L475 AbstractCegarLoop]: Abstraction has 46036 states and 68207 transitions. [2019-10-03 02:49:38,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:49:38,228 INFO L276 IsEmpty]: Start isEmpty. Operand 46036 states and 68207 transitions. [2019-10-03 02:49:38,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-03 02:49:38,272 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:38,272 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:38,272 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:38,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:38,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1544271440, now seen corresponding path program 1 times [2019-10-03 02:49:38,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:38,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:38,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:38,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:38,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:49:38,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:38,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:49:38,476 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:38,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:49:38,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:49:38,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:49:38,478 INFO L87 Difference]: Start difference. First operand 46036 states and 68207 transitions. Second operand 9 states. [2019-10-03 02:49:38,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:38,863 INFO L93 Difference]: Finished difference Result 46116 states and 67977 transitions. [2019-10-03 02:49:38,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:49:38,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 230 [2019-10-03 02:49:38,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:39,030 INFO L225 Difference]: With dead ends: 46116 [2019-10-03 02:49:39,030 INFO L226 Difference]: Without dead ends: 46116 [2019-10-03 02:49:39,031 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:49:39,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46116 states. [2019-10-03 02:49:40,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46116 to 45836. [2019-10-03 02:49:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45836 states. [2019-10-03 02:49:40,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45836 states to 45836 states and 67637 transitions. [2019-10-03 02:49:40,299 INFO L78 Accepts]: Start accepts. Automaton has 45836 states and 67637 transitions. Word has length 230 [2019-10-03 02:49:40,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:40,300 INFO L475 AbstractCegarLoop]: Abstraction has 45836 states and 67637 transitions. [2019-10-03 02:49:40,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:49:40,300 INFO L276 IsEmpty]: Start isEmpty. Operand 45836 states and 67637 transitions. [2019-10-03 02:49:40,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-03 02:49:40,390 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:40,390 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:40,391 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:40,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:40,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1317898465, now seen corresponding path program 1 times [2019-10-03 02:49:40,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:40,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:40,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:40,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:40,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:49:40,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:40,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:49:40,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:40,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:49:40,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:49:40,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:49:40,576 INFO L87 Difference]: Start difference. First operand 45836 states and 67637 transitions. Second operand 6 states. [2019-10-03 02:49:41,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:41,559 INFO L93 Difference]: Finished difference Result 91287 states and 135147 transitions. [2019-10-03 02:49:41,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:49:41,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 233 [2019-10-03 02:49:41,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:41,943 INFO L225 Difference]: With dead ends: 91287 [2019-10-03 02:49:41,943 INFO L226 Difference]: Without dead ends: 83933 [2019-10-03 02:49:41,944 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:49:42,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83933 states. [2019-10-03 02:49:43,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83933 to 83168. [2019-10-03 02:49:43,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83168 states. [2019-10-03 02:49:47,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83168 states to 83168 states and 123597 transitions. [2019-10-03 02:49:47,277 INFO L78 Accepts]: Start accepts. Automaton has 83168 states and 123597 transitions. Word has length 233 [2019-10-03 02:49:47,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:47,277 INFO L475 AbstractCegarLoop]: Abstraction has 83168 states and 123597 transitions. [2019-10-03 02:49:47,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:49:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 83168 states and 123597 transitions. [2019-10-03 02:49:47,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-03 02:49:47,354 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:47,354 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:47,355 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:47,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:47,355 INFO L82 PathProgramCache]: Analyzing trace with hash 192206733, now seen corresponding path program 1 times [2019-10-03 02:49:47,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:47,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:47,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:47,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:47,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:49:47,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:47,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:49:47,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:47,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:49:47,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:49:47,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:49:47,487 INFO L87 Difference]: Start difference. First operand 83168 states and 123597 transitions. Second operand 3 states. [2019-10-03 02:49:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:47,856 INFO L93 Difference]: Finished difference Result 98378 states and 150855 transitions. [2019-10-03 02:49:47,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:49:47,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-03 02:49:47,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:48,179 INFO L225 Difference]: With dead ends: 98378 [2019-10-03 02:49:48,180 INFO L226 Difference]: Without dead ends: 98378 [2019-10-03 02:49:48,181 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:49:48,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98378 states. [2019-10-03 02:49:50,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98378 to 98336. [2019-10-03 02:49:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98336 states. [2019-10-03 02:49:50,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98336 states to 98336 states and 150813 transitions. [2019-10-03 02:49:50,527 INFO L78 Accepts]: Start accepts. Automaton has 98336 states and 150813 transitions. Word has length 233 [2019-10-03 02:49:50,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:50,528 INFO L475 AbstractCegarLoop]: Abstraction has 98336 states and 150813 transitions. [2019-10-03 02:49:50,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:49:50,528 INFO L276 IsEmpty]: Start isEmpty. Operand 98336 states and 150813 transitions. [2019-10-03 02:49:50,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-03 02:49:50,682 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:50,683 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:50,683 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:50,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:50,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1313787010, now seen corresponding path program 1 times [2019-10-03 02:49:50,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:50,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:50,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:50,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:50,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:50,822 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:49:50,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:50,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:49:50,822 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:50,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:49:50,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:49:50,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:49:50,824 INFO L87 Difference]: Start difference. First operand 98336 states and 150813 transitions. Second operand 3 states. [2019-10-03 02:49:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:51,921 INFO L93 Difference]: Finished difference Result 127562 states and 202599 transitions. [2019-10-03 02:49:51,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:49:51,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-10-03 02:49:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:52,255 INFO L225 Difference]: With dead ends: 127562 [2019-10-03 02:49:52,255 INFO L226 Difference]: Without dead ends: 127562 [2019-10-03 02:49:52,255 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:49:52,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127562 states. [2019-10-03 02:49:57,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127562 to 127520. [2019-10-03 02:49:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127520 states. [2019-10-03 02:49:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127520 states to 127520 states and 202557 transitions. [2019-10-03 02:49:57,404 INFO L78 Accepts]: Start accepts. Automaton has 127520 states and 202557 transitions. Word has length 234 [2019-10-03 02:49:57,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:57,404 INFO L475 AbstractCegarLoop]: Abstraction has 127520 states and 202557 transitions. [2019-10-03 02:49:57,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:49:57,405 INFO L276 IsEmpty]: Start isEmpty. Operand 127520 states and 202557 transitions. [2019-10-03 02:49:57,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-03 02:49:57,676 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:57,676 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:57,676 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:57,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:57,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1054897331, now seen corresponding path program 1 times [2019-10-03 02:49:57,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:57,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:57,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:57,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:57,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:57,844 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:49:57,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:57,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:49:57,845 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:57,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:49:57,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:49:57,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:49:57,846 INFO L87 Difference]: Start difference. First operand 127520 states and 202557 transitions. Second operand 7 states. [2019-10-03 02:50:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:01,689 INFO L93 Difference]: Finished difference Result 242222 states and 382847 transitions. [2019-10-03 02:50:01,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:50:01,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 235 [2019-10-03 02:50:01,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:02,886 INFO L225 Difference]: With dead ends: 242222 [2019-10-03 02:50:02,886 INFO L226 Difference]: Without dead ends: 241800 [2019-10-03 02:50:02,887 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:50:03,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241800 states. [2019-10-03 02:50:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241800 to 241770. [2019-10-03 02:50:12,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241770 states. [2019-10-03 02:50:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241770 states to 241770 states and 381969 transitions. [2019-10-03 02:50:14,324 INFO L78 Accepts]: Start accepts. Automaton has 241770 states and 381969 transitions. Word has length 235 [2019-10-03 02:50:14,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:14,325 INFO L475 AbstractCegarLoop]: Abstraction has 241770 states and 381969 transitions. [2019-10-03 02:50:14,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:50:14,325 INFO L276 IsEmpty]: Start isEmpty. Operand 241770 states and 381969 transitions. [2019-10-03 02:50:14,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-03 02:50:14,569 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:14,570 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:14,570 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:14,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:14,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1477735794, now seen corresponding path program 1 times [2019-10-03 02:50:14,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:14,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:14,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:14,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:14,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:50:14,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:14,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-03 02:50:14,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:14,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-03 02:50:15,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-03 02:50:15,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-10-03 02:50:15,001 INFO L87 Difference]: Start difference. First operand 241770 states and 381969 transitions. Second operand 26 states. [2019-10-03 02:50:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:17,185 INFO L93 Difference]: Finished difference Result 267557 states and 423418 transitions. [2019-10-03 02:50:17,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-03 02:50:17,188 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 236 [2019-10-03 02:50:17,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:18,344 INFO L225 Difference]: With dead ends: 267557 [2019-10-03 02:50:18,345 INFO L226 Difference]: Without dead ends: 267557 [2019-10-03 02:50:18,345 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-10-03 02:50:18,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267557 states. [2019-10-03 02:50:30,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267557 to 267246. [2019-10-03 02:50:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267246 states. [2019-10-03 02:50:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267246 states to 267246 states and 422937 transitions. [2019-10-03 02:50:32,862 INFO L78 Accepts]: Start accepts. Automaton has 267246 states and 422937 transitions. Word has length 236 [2019-10-03 02:50:32,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:32,863 INFO L475 AbstractCegarLoop]: Abstraction has 267246 states and 422937 transitions. [2019-10-03 02:50:32,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-03 02:50:32,863 INFO L276 IsEmpty]: Start isEmpty. Operand 267246 states and 422937 transitions. [2019-10-03 02:50:33,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-03 02:50:33,137 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:33,137 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:33,138 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:33,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:33,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1201823806, now seen corresponding path program 1 times [2019-10-03 02:50:33,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:33,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:33,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:33,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:33,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:50:33,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:33,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:50:33,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:33,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:50:33,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:50:33,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:50:33,304 INFO L87 Difference]: Start difference. First operand 267246 states and 422937 transitions. Second operand 10 states. [2019-10-03 02:50:34,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:34,604 INFO L93 Difference]: Finished difference Result 268926 states and 424907 transitions. [2019-10-03 02:50:34,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:50:34,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 240 [2019-10-03 02:50:34,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:35,655 INFO L225 Difference]: With dead ends: 268926 [2019-10-03 02:50:35,655 INFO L226 Difference]: Without dead ends: 268918 [2019-10-03 02:50:35,655 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:50:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268918 states. [2019-10-03 02:50:48,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268918 to 268918. [2019-10-03 02:50:48,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268918 states. [2019-10-03 02:50:51,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268918 states to 268918 states and 424895 transitions. [2019-10-03 02:50:51,075 INFO L78 Accepts]: Start accepts. Automaton has 268918 states and 424895 transitions. Word has length 240 [2019-10-03 02:50:51,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:51,075 INFO L475 AbstractCegarLoop]: Abstraction has 268918 states and 424895 transitions. [2019-10-03 02:50:51,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:50:51,075 INFO L276 IsEmpty]: Start isEmpty. Operand 268918 states and 424895 transitions. [2019-10-03 02:50:51,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-03 02:50:51,328 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:51,328 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:51,328 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:51,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:51,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1556209583, now seen corresponding path program 1 times [2019-10-03 02:50:51,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:51,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:51,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:51,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:51,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:51,449 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:50:51,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:51,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:50:51,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:51,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:50:51,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:50:51,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:50:51,450 INFO L87 Difference]: Start difference. First operand 268918 states and 424895 transitions. Second operand 5 states. [2019-10-03 02:50:58,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:58,956 INFO L93 Difference]: Finished difference Result 274648 states and 440831 transitions. [2019-10-03 02:50:58,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:50:58,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-10-03 02:50:58,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:51:00,083 INFO L225 Difference]: With dead ends: 274648 [2019-10-03 02:51:00,083 INFO L226 Difference]: Without dead ends: 274648 [2019-10-03 02:51:00,083 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:51:00,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274648 states. [2019-10-03 02:51:06,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274648 to 271782. [2019-10-03 02:51:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271782 states. [2019-10-03 02:51:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271782 states to 271782 states and 427877 transitions. [2019-10-03 02:51:08,128 INFO L78 Accepts]: Start accepts. Automaton has 271782 states and 427877 transitions. Word has length 245 [2019-10-03 02:51:08,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:51:08,128 INFO L475 AbstractCegarLoop]: Abstraction has 271782 states and 427877 transitions. [2019-10-03 02:51:08,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:51:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 271782 states and 427877 transitions. [2019-10-03 02:51:08,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-03 02:51:08,426 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:51:08,426 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:51:08,426 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:51:08,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:51:08,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1500388533, now seen corresponding path program 1 times [2019-10-03 02:51:08,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:51:08,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:08,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:51:08,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:08,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:51:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:51:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 02:51:08,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:51:08,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:51:08,558 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 252 with the following transitions: [2019-10-03 02:51:08,560 INFO L207 CegarAbsIntRunner]: [44], [47], [50], [72], [76], [80], [83], [85], [109], [112], [122], [123], [139], [142], [151], [152], [155], [156], [157], [159], [269], [271], [275], [278], [279], [280], [283], [289], [313], [315], [317], [320], [328], [330], [331], [334], [343], [354], [356], [359], [363], [364], [366], [367], [370], [380], [381], [382], [393], [396], [402], [404], [423], [426], [435], [517], [613], [615], [616], [617], [624], [635], [637], [642], [666], [669], [683], [712], [714], [727], [728], [762], [766], [769], [777], [780], [797], [801], [804], [810], [811], [813], [838], [844], [853], [857], [859], [861], [864], [871], [878], [885], [892], [899], [906], [913], [920], [927], [934], [937], [939], [1146], [1200], [1202], [1219], [1223], [1228], [1231], [1240], [1241], [1252], [1255], [1256], [1259], [1262], [1293], [1296], [1298], [1367], [1371], [1375], [1378], [1380], [1381], [1384], [1390], [1411], [1414], [1428], [1436], [1439], [1441], [1444], [1448], [1642], [1644], [1646], [1648], [1649], [1661], [1662], [1663], [1664], [1665], [1666], [1667], [1679], [1689], [1690], [1691], [1692], [1693], [1694], [1697], [1698], [1699], [1700], [1701], [1703], [1704], [1705], [1706], [1713], [1714], [1715], [1716], [1717], [1718], [1719], [1720], [1721], [1723], [1724], [1729], [1730], [1733], [1734], [1739], [1740], [1741], [1742], [1753], [1769], [1770], [1777], [1778], [1779], [1780], [1781], [1789], [1790], [1791], [1793], [1794], [1795], [1796], [1797], [1798], [1799], [1800], [1801], [1803], [1804], [1805], [1806], [1821], [1822], [1833], [1847], [1848], [1859], [1861], [1862], [1879], [1881], [1882], [1883], [1884], [1885], [1886], [1887], [1909], [1910], [1911], [1912], [1913], [1914], [1915], [1916], [1917] [2019-10-03 02:51:08,603 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:51:08,603 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:51:08,719 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:51:08,720 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 203 root evaluator evaluations with a maximum evaluation depth of 0. Performed 203 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 372 variables. [2019-10-03 02:51:08,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:51:08,726 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:51:08,842 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:51:08,843 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:51:08,855 INFO L420 sIntCurrentIteration]: We unified 250 AI predicates to 250 [2019-10-03 02:51:08,855 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:51:08,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:51:08,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2019-10-03 02:51:08,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:51:08,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:51:08,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:51:08,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:51:08,858 INFO L87 Difference]: Start difference. First operand 271782 states and 427877 transitions. Second operand 2 states. [2019-10-03 02:51:08,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:51:08,859 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:51:08,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:51:08,859 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 251 [2019-10-03 02:51:08,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:51:08,860 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:51:08,860 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:51:08,860 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:51:08,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:51:08,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:51:08,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:51:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:51:08,861 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 251 [2019-10-03 02:51:08,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:51:08,861 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:51:08,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:51:08,862 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:51:08,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:51:08,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:51:08 BoogieIcfgContainer [2019-10-03 02:51:08,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:51:08,872 INFO L168 Benchmark]: Toolchain (without parser) took 132032.62 ms. Allocated memory was 140.5 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 85.4 MB in the beginning and 1.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-10-03 02:51:08,873 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory was 106.5 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:51:08,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1391.38 ms. Allocated memory was 140.5 MB in the beginning and 199.8 MB in the end (delta: 59.2 MB). Free memory was 85.2 MB in the beginning and 130.1 MB in the end (delta: -44.9 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:51:08,880 INFO L168 Benchmark]: Boogie Preprocessor took 202.28 ms. Allocated memory is still 199.8 MB. Free memory was 130.1 MB in the beginning and 121.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-10-03 02:51:08,881 INFO L168 Benchmark]: RCFGBuilder took 2414.13 ms. Allocated memory was 199.8 MB in the beginning and 264.2 MB in the end (delta: 64.5 MB). Free memory was 121.0 MB in the beginning and 156.7 MB in the end (delta: -35.8 MB). Peak memory consumption was 82.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:51:08,882 INFO L168 Benchmark]: TraceAbstraction took 128017.86 ms. Allocated memory was 264.2 MB in the beginning and 3.6 GB in the end (delta: 3.3 GB). Free memory was 156.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-10-03 02:51:08,895 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory was 106.5 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1391.38 ms. Allocated memory was 140.5 MB in the beginning and 199.8 MB in the end (delta: 59.2 MB). Free memory was 85.2 MB in the beginning and 130.1 MB in the end (delta: -44.9 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 202.28 ms. Allocated memory is still 199.8 MB. Free memory was 130.1 MB in the beginning and 121.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2414.13 ms. Allocated memory was 199.8 MB in the beginning and 264.2 MB in the end (delta: 64.5 MB). Free memory was 121.0 MB in the beginning and 156.7 MB in the end (delta: -35.8 MB). Peak memory consumption was 82.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 128017.86 ms. Allocated memory was 264.2 MB in the beginning and 3.6 GB in the end (delta: 3.3 GB). Free memory was 156.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2970]: 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 115 procedures, 787 locations, 1 error locations. SAFE Result, 127.9s OverallTime, 27 OverallIterations, 3 TraceHistogramMax, 42.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23354 SDtfs, 11312 SDslu, 144264 SDs, 0 SdLazy, 14195 SolverSat, 1264 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 652 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1445 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=271782occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.92 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 73.6s AutomataMinimizationTime, 27 MinimizatonAttempts, 5944 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 6197 NumberOfCodeBlocks, 6197 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6170 ConstructedInterpolants, 0 QuantifiedInterpolants, 1809337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 26 PerfectInterpolantSequences, 1013/1016 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...