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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec0_product35.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:29:41,673 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:29:41,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:29:41,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:29:41,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:29:41,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:29:41,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:29:41,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:29:41,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:29:41,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:29:41,695 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:29:41,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:29:41,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:29:41,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:29:41,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:29:41,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:29:41,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:29:41,701 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:29:41,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:29:41,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:29:41,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:29:41,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:29:41,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:29:41,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:29:41,711 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:29:41,711 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:29:41,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:29:41,712 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:29:41,713 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:29:41,714 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:29:41,714 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:29:41,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:29:41,716 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:29:41,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:29:41,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:29:41,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:29:41,718 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:29:41,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:29:41,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:29:41,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:29:41,720 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:29:41,721 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 04:29:41,735 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:29:41,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:29:41,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:29:41,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:29:41,737 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:29:41,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:29:41,738 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:29:41,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:29:41,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:29:41,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:29:41,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:29:41,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:29:41,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:29:41,739 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:29:41,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:29:41,740 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:29:41,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:29:41,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:29:41,740 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:29:41,740 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:29:41,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:29:41,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:29:41,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:29:41,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:29:41,741 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:29:41,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:29:41,742 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:29:41,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:29:41,742 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:29:41,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:29:41,784 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:29:41,787 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:29:41,789 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:29:41,790 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:29:41,790 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product35.cil.c [2019-09-08 04:29:41,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60755e62/8db40c8dec50408b8480c77feb9b4b51/FLAG3bf449ef1 [2019-09-08 04:29:42,494 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:29:42,495 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product35.cil.c [2019-09-08 04:29:42,524 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60755e62/8db40c8dec50408b8480c77feb9b4b51/FLAG3bf449ef1 [2019-09-08 04:29:42,692 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60755e62/8db40c8dec50408b8480c77feb9b4b51 [2019-09-08 04:29:42,704 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:29:42,705 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:29:42,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:29:42,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:29:42,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:29:42,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:29:42" (1/1) ... [2019-09-08 04:29:42,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6595b9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:42, skipping insertion in model container [2019-09-08 04:29:42,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:29:42" (1/1) ... [2019-09-08 04:29:42,720 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:29:42,808 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:29:43,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:29:43,684 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:29:43,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:29:43,904 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:29:43,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:43 WrapperNode [2019-09-08 04:29:43,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:29:43,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:29:43,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:29:43,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:29:43,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:43" (1/1) ... [2019-09-08 04:29:43,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:43" (1/1) ... [2019-09-08 04:29:43,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:43" (1/1) ... [2019-09-08 04:29:43,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:43" (1/1) ... [2019-09-08 04:29:44,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:43" (1/1) ... [2019-09-08 04:29:44,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:43" (1/1) ... [2019-09-08 04:29:44,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:43" (1/1) ... [2019-09-08 04:29:44,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:29:44,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:29:44,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:29:44,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:29:44,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:29:44,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:29:44,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:29:44,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:29:44,174 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 04:29:44,174 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 04:29:44,174 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-08 04:29:44,174 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-08 04:29:44,175 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 04:29:44,175 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 04:29:44,175 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 04:29:44,175 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 04:29:44,175 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 04:29:44,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:29:44,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:29:44,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:29:44,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:29:44,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:29:44,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:29:44,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:29:44,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2019-09-08 04:29:44,177 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:29:44,179 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:29:44,179 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:29:44,179 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:29:44,180 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 04:29:44,180 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 04:29:44,180 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-08 04:29:44,180 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-08 04:29:44,180 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 04:29:44,181 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 04:29:44,181 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 04:29:44,181 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 04:29:44,181 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-08 04:29:44,181 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 04:29:44,182 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 04:29:44,182 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 04:29:44,182 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 04:29:44,182 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 04:29:44,182 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 04:29:44,183 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 04:29:44,183 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 04:29:44,183 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 04:29:44,183 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 04:29:44,183 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 04:29:44,184 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 04:29:44,184 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 04:29:44,184 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 04:29:44,184 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 04:29:44,184 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 04:29:44,185 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 04:29:44,185 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 04:29:44,185 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 04:29:44,185 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 04:29:44,185 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 04:29:44,185 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 04:29:44,186 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 04:29:44,186 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 04:29:44,186 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 04:29:44,186 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 04:29:44,187 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 04:29:44,187 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 04:29:44,187 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 04:29:44,187 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 04:29:44,188 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 04:29:44,188 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 04:29:44,188 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 04:29:44,188 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 04:29:44,188 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 04:29:44,189 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 04:29:44,189 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 04:29:44,189 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 04:29:44,189 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 04:29:44,190 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 04:29:44,190 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 04:29:44,191 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 04:29:44,191 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 04:29:44,191 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 04:29:44,191 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:29:44,191 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 04:29:44,191 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 04:29:44,192 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 04:29:44,192 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 04:29:44,193 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 04:29:44,193 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 04:29:44,193 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 04:29:44,193 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 04:29:44,194 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:29:44,195 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:29:44,195 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 04:29:44,195 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 04:29:44,195 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 04:29:44,196 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 04:29:44,197 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 04:29:44,197 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 04:29:44,197 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 04:29:44,197 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 04:29:44,197 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 04:29:44,198 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 04:29:44,198 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 04:29:44,198 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 04:29:44,198 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 04:29:44,198 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 04:29:44,199 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 04:29:44,199 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 04:29:44,199 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 04:29:44,199 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 04:29:44,199 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 04:29:44,200 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 04:29:44,200 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 04:29:44,200 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 04:29:44,200 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 04:29:44,200 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 04:29:44,200 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 04:29:44,200 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 04:29:44,201 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 04:29:44,201 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 04:29:44,201 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 04:29:44,202 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 04:29:44,202 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 04:29:44,202 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 04:29:44,203 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 04:29:44,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:29:44,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:29:44,203 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:29:44,205 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 04:29:44,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:29:44,205 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 04:29:44,206 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 04:29:44,206 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 04:29:44,206 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 04:29:44,206 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 04:29:44,207 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 04:29:44,207 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 04:29:44,207 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 04:29:44,208 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 04:29:44,208 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 04:29:44,208 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 04:29:44,208 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 04:29:44,209 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 04:29:44,210 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 04:29:44,214 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 04:29:44,214 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-08 04:29:44,214 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-08 04:29:44,215 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 04:29:44,223 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:29:44,223 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:29:44,224 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:29:44,224 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:29:44,224 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:29:44,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:29:44,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:29:44,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:29:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:29:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:29:44,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:29:44,227 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:29:44,227 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:29:44,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:29:44,228 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:29:44,228 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:29:44,228 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:29:44,228 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 04:29:44,228 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2019-09-08 04:29:44,229 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:29:44,229 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:29:44,229 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:29:44,229 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:29:44,229 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 04:29:44,230 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 04:29:44,230 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 04:29:44,230 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 04:29:44,230 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 04:29:44,230 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 04:29:44,230 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 04:29:44,231 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 04:29:44,231 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 04:29:44,231 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 04:29:44,231 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 04:29:44,231 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 04:29:44,232 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 04:29:44,232 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 04:29:44,232 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 04:29:44,232 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 04:29:44,232 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 04:29:44,232 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 04:29:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 04:29:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 04:29:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 04:29:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 04:29:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 04:29:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 04:29:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 04:29:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 04:29:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 04:29:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 04:29:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 04:29:44,235 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 04:29:44,235 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 04:29:44,235 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 04:29:44,235 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-08 04:29:44,235 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-08 04:29:44,235 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 04:29:44,236 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 04:29:44,236 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-08 04:29:44,236 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 04:29:44,236 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 04:29:44,236 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 04:29:44,237 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 04:29:44,239 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 04:29:44,239 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 04:29:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 04:29:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 04:29:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 04:29:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 04:29:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 04:29:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 04:29:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 04:29:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 04:29:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 04:29:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 04:29:44,242 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 04:29:44,242 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 04:29:44,242 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 04:29:44,242 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 04:29:44,242 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 04:29:44,242 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 04:29:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 04:29:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 04:29:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 04:29:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 04:29:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 04:29:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 04:29:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 04:29:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 04:29:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 04:29:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 04:29:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:29:44,245 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 04:29:44,245 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 04:29:44,245 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 04:29:44,245 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 04:29:44,245 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:29:44,245 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:29:44,246 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 04:29:44,246 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 04:29:44,246 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 04:29:44,246 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 04:29:44,246 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 04:29:44,246 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 04:29:44,247 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 04:29:44,247 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 04:29:44,247 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 04:29:44,247 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 04:29:44,247 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 04:29:44,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:29:44,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:29:44,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:29:46,512 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:29:46,512 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 04:29:46,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:29:46 BoogieIcfgContainer [2019-09-08 04:29:46,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:29:46,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:29:46,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:29:46,519 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:29:46,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:29:42" (1/3) ... [2019-09-08 04:29:46,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231b192f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:29:46, skipping insertion in model container [2019-09-08 04:29:46,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:43" (2/3) ... [2019-09-08 04:29:46,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231b192f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:29:46, skipping insertion in model container [2019-09-08 04:29:46,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:29:46" (3/3) ... [2019-09-08 04:29:46,528 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product35.cil.c [2019-09-08 04:29:46,539 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:29:46,548 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:29:46,567 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:29:46,610 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:29:46,612 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:29:46,612 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:29:46,612 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:29:46,612 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:29:46,612 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:29:46,613 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:29:46,613 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:29:46,613 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:29:46,655 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states. [2019-09-08 04:29:46,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 04:29:46,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:46,697 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:46,701 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:46,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:46,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1323292494, now seen corresponding path program 1 times [2019-09-08 04:29:46,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:46,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:46,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:46,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:46,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:47,498 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:29:47,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:47,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 04:29:47,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 04:29:47,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 04:29:47,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:29:47,520 INFO L87 Difference]: Start difference. First operand 680 states. Second operand 2 states. [2019-09-08 04:29:47,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:47,604 INFO L93 Difference]: Finished difference Result 1035 states and 1395 transitions. [2019-09-08 04:29:47,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 04:29:47,605 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 241 [2019-09-08 04:29:47,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:47,630 INFO L225 Difference]: With dead ends: 1035 [2019-09-08 04:29:47,630 INFO L226 Difference]: Without dead ends: 651 [2019-09-08 04:29:47,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:29:47,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-09-08 04:29:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-09-08 04:29:47,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-08 04:29:47,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 881 transitions. [2019-09-08 04:29:47,784 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 881 transitions. Word has length 241 [2019-09-08 04:29:47,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:47,788 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 881 transitions. [2019-09-08 04:29:47,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 04:29:47,788 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 881 transitions. [2019-09-08 04:29:47,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 04:29:47,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:47,799 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:47,799 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:47,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:47,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1534104076, now seen corresponding path program 1 times [2019-09-08 04:29:47,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:47,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:47,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:47,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:47,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:29:48,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:48,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:29:48,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:29:48,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:29:48,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:29:48,230 INFO L87 Difference]: Start difference. First operand 651 states and 881 transitions. Second operand 3 states. [2019-09-08 04:29:48,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:48,314 INFO L93 Difference]: Finished difference Result 1018 states and 1356 transitions. [2019-09-08 04:29:48,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:29:48,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-09-08 04:29:48,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:48,327 INFO L225 Difference]: With dead ends: 1018 [2019-09-08 04:29:48,327 INFO L226 Difference]: Without dead ends: 654 [2019-09-08 04:29:48,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:29:48,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-09-08 04:29:48,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 653. [2019-09-08 04:29:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-09-08 04:29:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 883 transitions. [2019-09-08 04:29:48,368 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 883 transitions. Word has length 242 [2019-09-08 04:29:48,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:48,369 INFO L475 AbstractCegarLoop]: Abstraction has 653 states and 883 transitions. [2019-09-08 04:29:48,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:29:48,369 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 883 transitions. [2019-09-08 04:29:48,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 04:29:48,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:48,378 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:48,378 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:48,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:48,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1794718877, now seen corresponding path program 1 times [2019-09-08 04:29:48,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:48,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:48,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:48,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:48,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:29:48,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:48,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:29:48,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:29:48,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:29:48,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:29:48,594 INFO L87 Difference]: Start difference. First operand 653 states and 883 transitions. Second operand 3 states. [2019-09-08 04:29:48,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:48,637 INFO L93 Difference]: Finished difference Result 1286 states and 1770 transitions. [2019-09-08 04:29:48,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:29:48,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-09-08 04:29:48,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:48,643 INFO L225 Difference]: With dead ends: 1286 [2019-09-08 04:29:48,643 INFO L226 Difference]: Without dead ends: 698 [2019-09-08 04:29:48,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:29:48,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-09-08 04:29:48,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 697. [2019-09-08 04:29:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-08 04:29:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 958 transitions. [2019-09-08 04:29:48,719 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 958 transitions. Word has length 254 [2019-09-08 04:29:48,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:48,719 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 958 transitions. [2019-09-08 04:29:48,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:29:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 958 transitions. [2019-09-08 04:29:48,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-08 04:29:48,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:48,726 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:48,726 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:48,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:48,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1323106751, now seen corresponding path program 1 times [2019-09-08 04:29:48,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:48,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:48,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:48,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:48,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:29:48,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:48,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:29:48,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:29:48,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:29:48,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:29:48,901 INFO L87 Difference]: Start difference. First operand 697 states and 958 transitions. Second operand 3 states. [2019-09-08 04:29:48,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:48,937 INFO L93 Difference]: Finished difference Result 1415 states and 1990 transitions. [2019-09-08 04:29:48,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:29:48,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-09-08 04:29:48,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:48,942 INFO L225 Difference]: With dead ends: 1415 [2019-09-08 04:29:48,943 INFO L226 Difference]: Without dead ends: 783 [2019-09-08 04:29:48,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:29:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-09-08 04:29:48,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 782. [2019-09-08 04:29:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-09-08 04:29:48,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1102 transitions. [2019-09-08 04:29:48,971 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1102 transitions. Word has length 255 [2019-09-08 04:29:48,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:48,972 INFO L475 AbstractCegarLoop]: Abstraction has 782 states and 1102 transitions. [2019-09-08 04:29:48,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:29:48,972 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1102 transitions. [2019-09-08 04:29:48,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-08 04:29:48,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:48,978 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:48,978 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:48,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:48,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1302871583, now seen corresponding path program 1 times [2019-09-08 04:29:48,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:48,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:48,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:48,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:48,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:49,614 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 04:29:49,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:49,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 04:29:49,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 04:29:49,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 04:29:49,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:29:49,618 INFO L87 Difference]: Start difference. First operand 782 states and 1102 transitions. Second operand 19 states. [2019-09-08 04:29:55,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:55,692 INFO L93 Difference]: Finished difference Result 2650 states and 3737 transitions. [2019-09-08 04:29:55,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 04:29:55,693 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 258 [2019-09-08 04:29:55,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:55,712 INFO L225 Difference]: With dead ends: 2650 [2019-09-08 04:29:55,712 INFO L226 Difference]: Without dead ends: 2299 [2019-09-08 04:29:55,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 04:29:55,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2019-09-08 04:29:55,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 2262. [2019-09-08 04:29:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2019-09-08 04:29:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 3204 transitions. [2019-09-08 04:29:55,880 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 3204 transitions. Word has length 258 [2019-09-08 04:29:55,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:55,881 INFO L475 AbstractCegarLoop]: Abstraction has 2262 states and 3204 transitions. [2019-09-08 04:29:55,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 04:29:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 3204 transitions. [2019-09-08 04:29:55,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-08 04:29:55,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:55,894 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:55,894 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:55,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:55,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1524612594, now seen corresponding path program 1 times [2019-09-08 04:29:55,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:55,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:55,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:55,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:55,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 04:29:56,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:56,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 04:29:56,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 04:29:56,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 04:29:56,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:29:56,307 INFO L87 Difference]: Start difference. First operand 2262 states and 3204 transitions. Second operand 15 states. [2019-09-08 04:30:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:00,396 INFO L93 Difference]: Finished difference Result 3819 states and 5362 transitions. [2019-09-08 04:30:00,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 04:30:00,399 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 259 [2019-09-08 04:30:00,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:00,415 INFO L225 Difference]: With dead ends: 3819 [2019-09-08 04:30:00,416 INFO L226 Difference]: Without dead ends: 2364 [2019-09-08 04:30:00,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 04:30:00,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2019-09-08 04:30:00,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 2332. [2019-09-08 04:30:00,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2332 states. [2019-09-08 04:30:00,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 3322 transitions. [2019-09-08 04:30:00,589 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 3322 transitions. Word has length 259 [2019-09-08 04:30:00,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:00,593 INFO L475 AbstractCegarLoop]: Abstraction has 2332 states and 3322 transitions. [2019-09-08 04:30:00,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 04:30:00,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 3322 transitions. [2019-09-08 04:30:00,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 04:30:00,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:00,610 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:30:00,610 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:00,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:00,611 INFO L82 PathProgramCache]: Analyzing trace with hash -334493030, now seen corresponding path program 1 times [2019-09-08 04:30:00,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:00,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:00,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:00,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:00,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:30:00,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:30:00,927 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:30:00,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:01,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 3348 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:30:01,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:30:01,786 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-08 04:30:01,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:30:01,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 04:30:01,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:30:01,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:30:01,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:30:01,812 INFO L87 Difference]: Start difference. First operand 2332 states and 3322 transitions. Second operand 12 states. [2019-09-08 04:30:04,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:04,730 INFO L93 Difference]: Finished difference Result 4246 states and 6087 transitions. [2019-09-08 04:30:04,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:30:04,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 262 [2019-09-08 04:30:04,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:04,744 INFO L225 Difference]: With dead ends: 4246 [2019-09-08 04:30:04,744 INFO L226 Difference]: Without dead ends: 1947 [2019-09-08 04:30:04,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:30:04,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2019-09-08 04:30:04,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1947. [2019-09-08 04:30:04,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1947 states. [2019-09-08 04:30:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 2786 transitions. [2019-09-08 04:30:04,863 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 2786 transitions. Word has length 262 [2019-09-08 04:30:04,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:04,863 INFO L475 AbstractCegarLoop]: Abstraction has 1947 states and 2786 transitions. [2019-09-08 04:30:04,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:30:04,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2786 transitions. [2019-09-08 04:30:04,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-08 04:30:04,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:04,873 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:30:04,873 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:04,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:04,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1918378653, now seen corresponding path program 1 times [2019-09-08 04:30:04,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:04,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:04,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:04,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:04,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 04:30:05,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:05,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 04:30:05,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 04:30:05,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 04:30:05,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:30:05,291 INFO L87 Difference]: Start difference. First operand 1947 states and 2786 transitions. Second operand 18 states. [2019-09-08 04:30:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:05,940 INFO L93 Difference]: Finished difference Result 3208 states and 4534 transitions. [2019-09-08 04:30:05,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 04:30:05,941 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 260 [2019-09-08 04:30:05,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:05,956 INFO L225 Difference]: With dead ends: 3208 [2019-09-08 04:30:05,956 INFO L226 Difference]: Without dead ends: 2067 [2019-09-08 04:30:05,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:30:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2019-09-08 04:30:06,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2067. [2019-09-08 04:30:06,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2067 states. [2019-09-08 04:30:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 2963 transitions. [2019-09-08 04:30:06,080 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 2963 transitions. Word has length 260 [2019-09-08 04:30:06,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:06,081 INFO L475 AbstractCegarLoop]: Abstraction has 2067 states and 2963 transitions. [2019-09-08 04:30:06,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 04:30:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 2963 transitions. [2019-09-08 04:30:06,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-08 04:30:06,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:06,093 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:30:06,094 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:06,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:06,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1819594443, now seen corresponding path program 1 times [2019-09-08 04:30:06,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:06,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:06,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:06,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:06,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-08 04:30:06,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:06,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:30:06,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:30:06,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:30:06,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:30:06,380 INFO L87 Difference]: Start difference. First operand 2067 states and 2963 transitions. Second operand 5 states. [2019-09-08 04:30:08,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:08,044 INFO L93 Difference]: Finished difference Result 5356 states and 7683 transitions. [2019-09-08 04:30:08,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:30:08,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 260 [2019-09-08 04:30:08,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:08,074 INFO L225 Difference]: With dead ends: 5356 [2019-09-08 04:30:08,075 INFO L226 Difference]: Without dead ends: 4519 [2019-09-08 04:30:08,081 INFO L628 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-09-08 04:30:08,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2019-09-08 04:30:08,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 4501. [2019-09-08 04:30:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4501 states. [2019-09-08 04:30:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4501 states to 4501 states and 6458 transitions. [2019-09-08 04:30:08,378 INFO L78 Accepts]: Start accepts. Automaton has 4501 states and 6458 transitions. Word has length 260 [2019-09-08 04:30:08,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:08,378 INFO L475 AbstractCegarLoop]: Abstraction has 4501 states and 6458 transitions. [2019-09-08 04:30:08,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:30:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 4501 states and 6458 transitions. [2019-09-08 04:30:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-08 04:30:08,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:08,391 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:30:08,391 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:08,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:08,392 INFO L82 PathProgramCache]: Analyzing trace with hash -639530006, now seen corresponding path program 1 times [2019-09-08 04:30:08,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:08,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:08,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:08,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:08,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:08,664 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 04:30:08,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:30:08,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:30:08,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:09,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 3345 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 04:30:09,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:30:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:30:09,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:30:09,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-08 04:30:09,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:30:09,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:30:09,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:30:09,504 INFO L87 Difference]: Start difference. First operand 4501 states and 6458 transitions. Second operand 12 states. [2019-09-08 04:30:15,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:15,249 INFO L93 Difference]: Finished difference Result 15623 states and 24230 transitions. [2019-09-08 04:30:15,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 04:30:15,254 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 260 [2019-09-08 04:30:15,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:15,340 INFO L225 Difference]: With dead ends: 15623 [2019-09-08 04:30:15,341 INFO L226 Difference]: Without dead ends: 11173 [2019-09-08 04:30:15,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-09-08 04:30:15,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11173 states. [2019-09-08 04:30:16,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11173 to 11163. [2019-09-08 04:30:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11163 states. [2019-09-08 04:30:16,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11163 states to 11163 states and 16963 transitions. [2019-09-08 04:30:16,836 INFO L78 Accepts]: Start accepts. Automaton has 11163 states and 16963 transitions. Word has length 260 [2019-09-08 04:30:16,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:16,836 INFO L475 AbstractCegarLoop]: Abstraction has 11163 states and 16963 transitions. [2019-09-08 04:30:16,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:30:16,836 INFO L276 IsEmpty]: Start isEmpty. Operand 11163 states and 16963 transitions. [2019-09-08 04:30:16,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-08 04:30:16,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:16,854 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:30:16,854 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:16,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:16,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1201483218, now seen corresponding path program 1 times [2019-09-08 04:30:16,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:16,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:16,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:16,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:16,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:17,358 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 04:30:17,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:30:17,359 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:30:17,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:17,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 3348 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:30:17,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:30:18,058 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 04:30:18,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:30:18,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [26] total 33 [2019-09-08 04:30:18,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 04:30:18,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 04:30:18,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=987, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 04:30:18,068 INFO L87 Difference]: Start difference. First operand 11163 states and 16963 transitions. Second operand 33 states. [2019-09-08 04:30:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:22,578 INFO L93 Difference]: Finished difference Result 22449 states and 34891 transitions. [2019-09-08 04:30:22,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 04:30:22,579 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 263 [2019-09-08 04:30:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:22,649 INFO L225 Difference]: With dead ends: 22449 [2019-09-08 04:30:22,650 INFO L226 Difference]: Without dead ends: 11347 [2019-09-08 04:30:22,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=202, Invalid=3338, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 04:30:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11347 states. [2019-09-08 04:30:23,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11347 to 11331. [2019-09-08 04:30:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11331 states. [2019-09-08 04:30:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11331 states to 11331 states and 17188 transitions. [2019-09-08 04:30:23,434 INFO L78 Accepts]: Start accepts. Automaton has 11331 states and 17188 transitions. Word has length 263 [2019-09-08 04:30:23,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:23,434 INFO L475 AbstractCegarLoop]: Abstraction has 11331 states and 17188 transitions. [2019-09-08 04:30:23,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 04:30:23,435 INFO L276 IsEmpty]: Start isEmpty. Operand 11331 states and 17188 transitions. [2019-09-08 04:30:23,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 04:30:23,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:23,454 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:30:23,454 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:23,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:23,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1608668948, now seen corresponding path program 1 times [2019-09-08 04:30:23,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:23,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:23,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:23,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:23,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:23,676 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 04:30:23,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:30:23,676 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:30:23,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:24,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 3364 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:30:24,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:30:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 04:30:24,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:30:24,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2019-09-08 04:30:24,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 04:30:24,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 04:30:24,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:30:24,462 INFO L87 Difference]: Start difference. First operand 11331 states and 17188 transitions. Second operand 17 states. [2019-09-08 04:30:27,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:27,048 INFO L93 Difference]: Finished difference Result 23067 states and 36100 transitions. [2019-09-08 04:30:27,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 04:30:27,049 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 268 [2019-09-08 04:30:27,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:27,107 INFO L225 Difference]: With dead ends: 23067 [2019-09-08 04:30:27,108 INFO L226 Difference]: Without dead ends: 11811 [2019-09-08 04:30:27,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2019-09-08 04:30:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11811 states. [2019-09-08 04:30:27,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11811 to 11427. [2019-09-08 04:30:27,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11427 states. [2019-09-08 04:30:27,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11427 states to 11427 states and 17323 transitions. [2019-09-08 04:30:27,699 INFO L78 Accepts]: Start accepts. Automaton has 11427 states and 17323 transitions. Word has length 268 [2019-09-08 04:30:27,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:27,699 INFO L475 AbstractCegarLoop]: Abstraction has 11427 states and 17323 transitions. [2019-09-08 04:30:27,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 04:30:27,700 INFO L276 IsEmpty]: Start isEmpty. Operand 11427 states and 17323 transitions. [2019-09-08 04:30:27,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-08 04:30:27,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:27,718 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:30:27,719 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:27,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:27,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1527624384, now seen corresponding path program 1 times [2019-09-08 04:30:27,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:27,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:27,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:27,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:27,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:28,031 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 04:30:28,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:28,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 04:30:28,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:30:28,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:30:28,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:30:28,034 INFO L87 Difference]: Start difference. First operand 11427 states and 17323 transitions. Second operand 13 states. [2019-09-08 04:30:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:32,457 INFO L93 Difference]: Finished difference Result 33262 states and 53311 transitions. [2019-09-08 04:30:32,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 04:30:32,458 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 276 [2019-09-08 04:30:32,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:32,606 INFO L225 Difference]: With dead ends: 33262 [2019-09-08 04:30:32,606 INFO L226 Difference]: Without dead ends: 23083 [2019-09-08 04:30:32,660 INFO L628 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-09-08 04:30:32,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23083 states. [2019-09-08 04:30:34,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23083 to 22978. [2019-09-08 04:30:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22978 states. [2019-09-08 04:30:34,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22978 states to 22978 states and 34764 transitions. [2019-09-08 04:30:34,629 INFO L78 Accepts]: Start accepts. Automaton has 22978 states and 34764 transitions. Word has length 276 [2019-09-08 04:30:34,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:34,631 INFO L475 AbstractCegarLoop]: Abstraction has 22978 states and 34764 transitions. [2019-09-08 04:30:34,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:30:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 22978 states and 34764 transitions. [2019-09-08 04:30:34,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-08 04:30:34,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:34,685 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:30:34,686 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:34,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:34,687 INFO L82 PathProgramCache]: Analyzing trace with hash -278188574, now seen corresponding path program 1 times [2019-09-08 04:30:34,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:34,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:34,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:34,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:34,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 04:30:34,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:34,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:30:34,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:30:34,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:30:34,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:30:34,866 INFO L87 Difference]: Start difference. First operand 22978 states and 34764 transitions. Second operand 3 states. [2019-09-08 04:30:35,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:35,634 INFO L93 Difference]: Finished difference Result 46857 states and 71226 transitions. [2019-09-08 04:30:35,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:30:35,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-09-08 04:30:35,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:35,786 INFO L225 Difference]: With dead ends: 46857 [2019-09-08 04:30:35,786 INFO L226 Difference]: Without dead ends: 23968 [2019-09-08 04:30:35,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:30:35,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23968 states. [2019-09-08 04:30:38,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23968 to 23962. [2019-09-08 04:30:38,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23962 states. [2019-09-08 04:30:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23962 states to 23962 states and 36534 transitions. [2019-09-08 04:30:38,178 INFO L78 Accepts]: Start accepts. Automaton has 23962 states and 36534 transitions. Word has length 274 [2019-09-08 04:30:38,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:38,178 INFO L475 AbstractCegarLoop]: Abstraction has 23962 states and 36534 transitions. [2019-09-08 04:30:38,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:30:38,178 INFO L276 IsEmpty]: Start isEmpty. Operand 23962 states and 36534 transitions. [2019-09-08 04:30:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-08 04:30:38,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:38,220 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:30:38,220 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:38,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:38,221 INFO L82 PathProgramCache]: Analyzing trace with hash -2090582878, now seen corresponding path program 1 times [2019-09-08 04:30:38,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:38,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:38,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:38,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:38,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:30:38,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:38,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 04:30:38,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:30:38,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:30:38,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:30:38,468 INFO L87 Difference]: Start difference. First operand 23962 states and 36534 transitions. Second operand 13 states. [2019-09-08 04:30:39,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:39,703 INFO L93 Difference]: Finished difference Result 46859 states and 74106 transitions. [2019-09-08 04:30:39,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:30:39,703 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 277 [2019-09-08 04:30:39,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:39,854 INFO L225 Difference]: With dead ends: 46859 [2019-09-08 04:30:39,854 INFO L226 Difference]: Without dead ends: 26390 [2019-09-08 04:30:39,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:30:39,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26390 states. [2019-09-08 04:30:41,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26390 to 26182. [2019-09-08 04:30:41,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26182 states. [2019-09-08 04:30:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26182 states to 26182 states and 40595 transitions. [2019-09-08 04:30:41,399 INFO L78 Accepts]: Start accepts. Automaton has 26182 states and 40595 transitions. Word has length 277 [2019-09-08 04:30:41,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:41,399 INFO L475 AbstractCegarLoop]: Abstraction has 26182 states and 40595 transitions. [2019-09-08 04:30:41,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:30:41,400 INFO L276 IsEmpty]: Start isEmpty. Operand 26182 states and 40595 transitions. [2019-09-08 04:30:41,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-08 04:30:41,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:41,440 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:30:41,441 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:41,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:41,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1839145675, now seen corresponding path program 1 times [2019-09-08 04:30:41,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:41,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:41,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:41,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:41,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:30:41,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:41,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:30:41,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:30:41,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:30:41,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:30:41,951 INFO L87 Difference]: Start difference. First operand 26182 states and 40595 transitions. Second operand 11 states. [2019-09-08 04:30:42,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:42,763 INFO L93 Difference]: Finished difference Result 49271 states and 79176 transitions. [2019-09-08 04:30:42,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:30:42,763 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 278 [2019-09-08 04:30:42,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:42,920 INFO L225 Difference]: With dead ends: 49271 [2019-09-08 04:30:42,921 INFO L226 Difference]: Without dead ends: 26486 [2019-09-08 04:30:43,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 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-09-08 04:30:43,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26486 states. [2019-09-08 04:30:44,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26486 to 26278. [2019-09-08 04:30:44,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26278 states. [2019-09-08 04:30:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26278 states to 26278 states and 40691 transitions. [2019-09-08 04:30:44,637 INFO L78 Accepts]: Start accepts. Automaton has 26278 states and 40691 transitions. Word has length 278 [2019-09-08 04:30:44,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:44,638 INFO L475 AbstractCegarLoop]: Abstraction has 26278 states and 40691 transitions. [2019-09-08 04:30:44,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:30:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 26278 states and 40691 transitions. [2019-09-08 04:30:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-08 04:30:44,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:44,663 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:30:44,663 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:44,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:44,663 INFO L82 PathProgramCache]: Analyzing trace with hash 674367887, now seen corresponding path program 1 times [2019-09-08 04:30:44,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:44,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:44,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:44,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:44,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:44,869 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:30:44,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:44,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:30:44,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:30:44,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:30:44,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:30:44,871 INFO L87 Difference]: Start difference. First operand 26278 states and 40691 transitions. Second operand 6 states. [2019-09-08 04:30:48,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:48,208 INFO L93 Difference]: Finished difference Result 76020 states and 120679 transitions. [2019-09-08 04:30:48,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:30:48,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 277 [2019-09-08 04:30:48,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:48,431 INFO L225 Difference]: With dead ends: 76020 [2019-09-08 04:30:48,431 INFO L226 Difference]: Without dead ends: 53139 [2019-09-08 04:30:48,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:30:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53139 states. [2019-09-08 04:30:50,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53139 to 53020. [2019-09-08 04:30:50,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53020 states. [2019-09-08 04:30:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53020 states to 53020 states and 82100 transitions. [2019-09-08 04:30:50,781 INFO L78 Accepts]: Start accepts. Automaton has 53020 states and 82100 transitions. Word has length 277 [2019-09-08 04:30:50,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:50,782 INFO L475 AbstractCegarLoop]: Abstraction has 53020 states and 82100 transitions. [2019-09-08 04:30:50,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:30:50,782 INFO L276 IsEmpty]: Start isEmpty. Operand 53020 states and 82100 transitions. [2019-09-08 04:30:50,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-09-08 04:30:50,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:50,828 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:30:50,828 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:50,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:50,828 INFO L82 PathProgramCache]: Analyzing trace with hash -892250367, now seen corresponding path program 1 times [2019-09-08 04:30:50,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:50,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:50,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:50,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:50,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:30:51,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:51,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:30:51,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:30:51,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:30:51,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:30:51,043 INFO L87 Difference]: Start difference. First operand 53020 states and 82100 transitions. Second operand 6 states. [2019-09-08 04:30:54,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:54,300 INFO L93 Difference]: Finished difference Result 153362 states and 243182 transitions. [2019-09-08 04:30:54,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:30:54,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 279 [2019-09-08 04:30:54,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:54,732 INFO L225 Difference]: With dead ends: 153362 [2019-09-08 04:30:54,732 INFO L226 Difference]: Without dead ends: 107047 [2019-09-08 04:30:54,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:30:54,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107047 states. [2019-09-08 04:31:03,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107047 to 106236. [2019-09-08 04:31:03,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106236 states. [2019-09-08 04:31:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106236 states to 106236 states and 164540 transitions. [2019-09-08 04:31:03,660 INFO L78 Accepts]: Start accepts. Automaton has 106236 states and 164540 transitions. Word has length 279 [2019-09-08 04:31:03,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:03,660 INFO L475 AbstractCegarLoop]: Abstraction has 106236 states and 164540 transitions. [2019-09-08 04:31:03,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:31:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 106236 states and 164540 transitions. [2019-09-08 04:31:03,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-08 04:31:03,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:03,730 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:31:03,731 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:03,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:03,731 INFO L82 PathProgramCache]: Analyzing trace with hash 379082759, now seen corresponding path program 1 times [2019-09-08 04:31:03,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:03,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:03,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:03,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:03,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:31:03,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:03,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:31:03,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:31:03,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:31:03,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:31:03,953 INFO L87 Difference]: Start difference. First operand 106236 states and 164540 transitions. Second operand 11 states. [2019-09-08 04:31:07,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:07,701 INFO L93 Difference]: Finished difference Result 207095 states and 329446 transitions. [2019-09-08 04:31:07,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:31:07,702 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 280 [2019-09-08 04:31:07,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:08,348 INFO L225 Difference]: With dead ends: 207095 [2019-09-08 04:31:08,348 INFO L226 Difference]: Without dead ends: 114564 [2019-09-08 04:31:08,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 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-09-08 04:31:08,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114564 states. [2019-09-08 04:31:16,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114564 to 114020. [2019-09-08 04:31:16,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114020 states. [2019-09-08 04:31:17,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114020 states to 114020 states and 178520 transitions. [2019-09-08 04:31:17,371 INFO L78 Accepts]: Start accepts. Automaton has 114020 states and 178520 transitions. Word has length 280 [2019-09-08 04:31:17,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:17,371 INFO L475 AbstractCegarLoop]: Abstraction has 114020 states and 178520 transitions. [2019-09-08 04:31:17,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:31:17,372 INFO L276 IsEmpty]: Start isEmpty. Operand 114020 states and 178520 transitions. [2019-09-08 04:31:17,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-09-08 04:31:17,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:17,482 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:31:17,482 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:17,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:17,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1353149766, now seen corresponding path program 1 times [2019-09-08 04:31:17,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:17,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:17,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:17,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:17,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:17,759 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:31:17,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:17,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 04:31:17,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:31:17,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:31:17,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:31:17,763 INFO L87 Difference]: Start difference. First operand 114020 states and 178520 transitions. Second operand 13 states. [2019-09-08 04:31:25,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:25,674 INFO L93 Difference]: Finished difference Result 216679 states and 350374 transitions. [2019-09-08 04:31:25,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:31:25,674 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 281 [2019-09-08 04:31:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:26,229 INFO L225 Difference]: With dead ends: 216679 [2019-09-08 04:31:26,229 INFO L226 Difference]: Without dead ends: 115980 [2019-09-08 04:31:26,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:31:26,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115980 states. [2019-09-08 04:31:31,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115980 to 115436. [2019-09-08 04:31:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115436 states. [2019-09-08 04:31:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115436 states to 115436 states and 180464 transitions. [2019-09-08 04:31:32,001 INFO L78 Accepts]: Start accepts. Automaton has 115436 states and 180464 transitions. Word has length 281 [2019-09-08 04:31:32,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:32,002 INFO L475 AbstractCegarLoop]: Abstraction has 115436 states and 180464 transitions. [2019-09-08 04:31:32,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:31:32,002 INFO L276 IsEmpty]: Start isEmpty. Operand 115436 states and 180464 transitions. [2019-09-08 04:31:32,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-09-08 04:31:32,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:32,083 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:31:32,083 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:32,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:32,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1408518161, now seen corresponding path program 1 times [2019-09-08 04:31:32,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:32,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:32,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:32,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:32,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:32,326 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:31:32,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:32,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 04:31:32,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:31:32,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:31:32,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:31:32,329 INFO L87 Difference]: Start difference. First operand 115436 states and 180464 transitions. Second operand 13 states. [2019-09-08 04:31:36,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:36,365 INFO L93 Difference]: Finished difference Result 218383 states and 354004 transitions. [2019-09-08 04:31:36,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:31:36,365 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 281 [2019-09-08 04:31:36,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:36,845 INFO L225 Difference]: With dead ends: 218383 [2019-09-08 04:31:36,846 INFO L226 Difference]: Without dead ends: 116268 [2019-09-08 04:31:37,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:31:37,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116268 states. [2019-09-08 04:31:46,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116268 to 115436. [2019-09-08 04:31:46,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115436 states. [2019-09-08 04:31:46,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115436 states to 115436 states and 180008 transitions. [2019-09-08 04:31:46,948 INFO L78 Accepts]: Start accepts. Automaton has 115436 states and 180008 transitions. Word has length 281 [2019-09-08 04:31:46,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:46,949 INFO L475 AbstractCegarLoop]: Abstraction has 115436 states and 180008 transitions. [2019-09-08 04:31:46,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:31:46,949 INFO L276 IsEmpty]: Start isEmpty. Operand 115436 states and 180008 transitions. [2019-09-08 04:31:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-09-08 04:31:47,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:47,024 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:31:47,024 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:47,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:47,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2014092747, now seen corresponding path program 1 times [2019-09-08 04:31:47,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:47,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:47,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:47,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:47,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:31:47,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:47,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:31:47,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:31:47,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:31:47,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:31:47,223 INFO L87 Difference]: Start difference. First operand 115436 states and 180008 transitions. Second operand 11 states. [2019-09-08 04:31:51,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:51,108 INFO L93 Difference]: Finished difference Result 217343 states and 346510 transitions. [2019-09-08 04:31:51,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:31:51,109 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 279 [2019-09-08 04:31:51,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:51,610 INFO L225 Difference]: With dead ends: 217343 [2019-09-08 04:31:51,610 INFO L226 Difference]: Without dead ends: 115612 [2019-09-08 04:31:51,869 INFO L628 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-09-08 04:31:51,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115612 states. [2019-09-08 04:32:01,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115612 to 114852. [2019-09-08 04:32:01,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114852 states. [2019-09-08 04:32:01,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114852 states to 114852 states and 178284 transitions. [2019-09-08 04:32:01,658 INFO L78 Accepts]: Start accepts. Automaton has 114852 states and 178284 transitions. Word has length 279 [2019-09-08 04:32:01,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:01,659 INFO L475 AbstractCegarLoop]: Abstraction has 114852 states and 178284 transitions. [2019-09-08 04:32:01,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:32:01,660 INFO L276 IsEmpty]: Start isEmpty. Operand 114852 states and 178284 transitions. [2019-09-08 04:32:01,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-08 04:32:01,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:01,761 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:01,762 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:01,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:01,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1244420708, now seen corresponding path program 1 times [2019-09-08 04:32:01,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:01,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:01,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:01,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:01,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:01,961 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:32:01,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:01,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:32:01,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:32:01,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:32:01,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:32:01,963 INFO L87 Difference]: Start difference. First operand 114852 states and 178284 transitions. Second operand 6 states. [2019-09-08 04:32:09,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:09,755 INFO L93 Difference]: Finished difference Result 329042 states and 520410 transitions. [2019-09-08 04:32:09,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:32:09,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 282 [2019-09-08 04:32:09,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:10,596 INFO L225 Difference]: With dead ends: 329042 [2019-09-08 04:32:10,596 INFO L226 Difference]: Without dead ends: 204799 [2019-09-08 04:32:10,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:32:11,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204799 states. [2019-09-08 04:32:25,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204799 to 203794. [2019-09-08 04:32:25,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203794 states. [2019-09-08 04:32:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203794 states to 203794 states and 317055 transitions. [2019-09-08 04:32:26,157 INFO L78 Accepts]: Start accepts. Automaton has 203794 states and 317055 transitions. Word has length 282 [2019-09-08 04:32:26,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:26,158 INFO L475 AbstractCegarLoop]: Abstraction has 203794 states and 317055 transitions. [2019-09-08 04:32:26,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:32:26,158 INFO L276 IsEmpty]: Start isEmpty. Operand 203794 states and 317055 transitions. [2019-09-08 04:32:26,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-08 04:32:26,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:26,298 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:26,298 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:26,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:26,298 INFO L82 PathProgramCache]: Analyzing trace with hash -11337849, now seen corresponding path program 1 times [2019-09-08 04:32:26,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:26,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:26,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:26,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:26,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 04:32:26,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:26,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:32:26,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:32:26,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:32:26,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:26,442 INFO L87 Difference]: Start difference. First operand 203794 states and 317055 transitions. Second operand 3 states. [2019-09-08 04:32:40,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:40,463 INFO L93 Difference]: Finished difference Result 422711 states and 661652 transitions. [2019-09-08 04:32:40,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:32:40,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2019-09-08 04:32:40,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:41,391 INFO L225 Difference]: With dead ends: 422711 [2019-09-08 04:32:41,391 INFO L226 Difference]: Without dead ends: 219004 [2019-09-08 04:32:41,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:41,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219004 states. [2019-09-08 04:32:56,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219004 to 218962. [2019-09-08 04:32:56,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218962 states. [2019-09-08 04:32:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218962 states to 218962 states and 344271 transitions. [2019-09-08 04:32:57,833 INFO L78 Accepts]: Start accepts. Automaton has 218962 states and 344271 transitions. Word has length 282 [2019-09-08 04:32:57,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:57,834 INFO L475 AbstractCegarLoop]: Abstraction has 218962 states and 344271 transitions. [2019-09-08 04:32:57,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:32:57,834 INFO L276 IsEmpty]: Start isEmpty. Operand 218962 states and 344271 transitions. [2019-09-08 04:32:58,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-08 04:32:58,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:58,032 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:58,032 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:58,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:58,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2009337277, now seen corresponding path program 1 times [2019-09-08 04:32:58,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:58,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:58,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:58,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:58,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:58,209 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 04:32:58,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:58,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:32:58,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:32:58,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:32:58,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:58,211 INFO L87 Difference]: Start difference. First operand 218962 states and 344271 transitions. Second operand 3 states. [2019-09-08 04:33:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:33:13,450 INFO L93 Difference]: Finished difference Result 467063 states and 740996 transitions. [2019-09-08 04:33:13,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:33:13,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-09-08 04:33:13,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:33:15,098 INFO L225 Difference]: With dead ends: 467063 [2019-09-08 04:33:15,098 INFO L226 Difference]: Without dead ends: 248188 [2019-09-08 04:33:15,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:33:15,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248188 states. [2019-09-08 04:33:33,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248188 to 248146. [2019-09-08 04:33:33,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248146 states. [2019-09-08 04:33:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248146 states to 248146 states and 396015 transitions. [2019-09-08 04:33:34,189 INFO L78 Accepts]: Start accepts. Automaton has 248146 states and 396015 transitions. Word has length 283 [2019-09-08 04:33:34,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:33:34,189 INFO L475 AbstractCegarLoop]: Abstraction has 248146 states and 396015 transitions. [2019-09-08 04:33:34,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:33:34,189 INFO L276 IsEmpty]: Start isEmpty. Operand 248146 states and 396015 transitions. [2019-09-08 04:33:34,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-08 04:33:34,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:33:34,534 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:33:34,535 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:33:34,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:33:34,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1329580889, now seen corresponding path program 1 times [2019-09-08 04:33:34,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:33:34,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:33:34,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:34,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:33:34,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 04:33:35,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:33:35,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-08 04:33:35,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 04:33:35,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 04:33:35,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-09-08 04:33:35,091 INFO L87 Difference]: Start difference. First operand 248146 states and 396015 transitions. Second operand 30 states. [2019-09-08 04:33:53,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:33:53,951 INFO L93 Difference]: Finished difference Result 433494 states and 686115 transitions. [2019-09-08 04:33:53,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 04:33:53,952 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 284 [2019-09-08 04:33:53,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:33:55,034 INFO L225 Difference]: With dead ends: 433494 [2019-09-08 04:33:55,035 INFO L226 Difference]: Without dead ends: 256159 [2019-09-08 04:33:56,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=1697, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 04:33:56,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256159 states. [2019-09-08 04:34:07,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256159 to 255454. [2019-09-08 04:34:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255454 states. [2019-09-08 04:34:09,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255454 states to 255454 states and 406033 transitions. [2019-09-08 04:34:09,783 INFO L78 Accepts]: Start accepts. Automaton has 255454 states and 406033 transitions. Word has length 284 [2019-09-08 04:34:09,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:34:09,784 INFO L475 AbstractCegarLoop]: Abstraction has 255454 states and 406033 transitions. [2019-09-08 04:34:09,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 04:34:09,784 INFO L276 IsEmpty]: Start isEmpty. Operand 255454 states and 406033 transitions. [2019-09-08 04:34:10,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-09-08 04:34:10,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:34:10,065 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:34:10,065 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:34:10,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:34:10,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1392832113, now seen corresponding path program 1 times [2019-09-08 04:34:10,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:34:10,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:34:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:10,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:10,221 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:34:10,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:34:10,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:34:10,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:34:10,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:34:10,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:34:10,223 INFO L87 Difference]: Start difference. First operand 255454 states and 406033 transitions. Second operand 5 states. [2019-09-08 04:34:25,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:34:25,070 INFO L93 Difference]: Finished difference Result 444127 states and 702294 transitions. [2019-09-08 04:34:25,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:34:25,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 281 [2019-09-08 04:34:25,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:34:26,244 INFO L225 Difference]: With dead ends: 444127 [2019-09-08 04:34:26,244 INFO L226 Difference]: Without dead ends: 260060 [2019-09-08 04:34:26,655 INFO L628 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-09-08 04:34:26,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260060 states. [2019-09-08 04:34:45,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260060 to 257778. [2019-09-08 04:34:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257778 states. [2019-09-08 04:34:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257778 states to 257778 states and 409267 transitions. [2019-09-08 04:34:46,139 INFO L78 Accepts]: Start accepts. Automaton has 257778 states and 409267 transitions. Word has length 281 [2019-09-08 04:34:46,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:34:46,139 INFO L475 AbstractCegarLoop]: Abstraction has 257778 states and 409267 transitions. [2019-09-08 04:34:46,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:34:46,139 INFO L276 IsEmpty]: Start isEmpty. Operand 257778 states and 409267 transitions. [2019-09-08 04:34:46,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-09-08 04:34:46,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:34:46,445 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:34:46,445 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:34:46,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:34:46,446 INFO L82 PathProgramCache]: Analyzing trace with hash -556365369, now seen corresponding path program 1 times [2019-09-08 04:34:46,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:34:46,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:34:46,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:46,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:46,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:34:46,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:34:46,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 04:34:46,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:34:46,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:34:46,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:34:46,720 INFO L87 Difference]: Start difference. First operand 257778 states and 409267 transitions. Second operand 13 states. [2019-09-08 04:35:05,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:35:05,247 INFO L93 Difference]: Finished difference Result 443609 states and 693390 transitions. [2019-09-08 04:35:05,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:35:05,248 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 281 [2019-09-08 04:35:05,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:35:06,232 INFO L225 Difference]: With dead ends: 443609 [2019-09-08 04:35:06,233 INFO L226 Difference]: Without dead ends: 257218 [2019-09-08 04:35:06,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-09-08 04:35:06,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257218 states. [2019-09-08 04:35:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257218 to 256770. [2019-09-08 04:35:18,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256770 states. [2019-09-08 04:35:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256770 states to 256770 states and 407335 transitions. [2019-09-08 04:35:19,219 INFO L78 Accepts]: Start accepts. Automaton has 256770 states and 407335 transitions. Word has length 281 [2019-09-08 04:35:19,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:35:19,219 INFO L475 AbstractCegarLoop]: Abstraction has 256770 states and 407335 transitions. [2019-09-08 04:35:19,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:35:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 256770 states and 407335 transitions. [2019-09-08 04:35:19,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-08 04:35:19,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:35:19,506 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:35:19,506 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:35:19,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:35:19,506 INFO L82 PathProgramCache]: Analyzing trace with hash -570397213, now seen corresponding path program 1 times [2019-09-08 04:35:19,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:35:19,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:35:19,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:19,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:35:19,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:35:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:35:20,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:35:20,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:35:20,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:35:20,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:35:20,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:35:20,803 INFO L87 Difference]: Start difference. First operand 256770 states and 407335 transitions. Second operand 10 states. [2019-09-08 04:35:33,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:35:33,935 INFO L93 Difference]: Finished difference Result 257445 states and 408345 transitions. [2019-09-08 04:35:33,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:35:33,935 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 288 [2019-09-08 04:35:33,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:35:35,136 INFO L225 Difference]: With dead ends: 257445 [2019-09-08 04:35:35,136 INFO L226 Difference]: Without dead ends: 257442 [2019-09-08 04:35:35,248 INFO L628 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-09-08 04:35:35,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257442 states. [2019-09-08 04:35:46,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257442 to 257442. [2019-09-08 04:35:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257442 states. [2019-09-08 04:35:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257442 states to 257442 states and 407901 transitions. [2019-09-08 04:35:47,994 INFO L78 Accepts]: Start accepts. Automaton has 257442 states and 407901 transitions. Word has length 288 [2019-09-08 04:35:47,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:35:47,994 INFO L475 AbstractCegarLoop]: Abstraction has 257442 states and 407901 transitions. [2019-09-08 04:35:47,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:35:47,995 INFO L276 IsEmpty]: Start isEmpty. Operand 257442 states and 407901 transitions. [2019-09-08 04:35:48,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-08 04:35:48,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:35:48,347 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:35:48,347 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:35:48,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:35:48,348 INFO L82 PathProgramCache]: Analyzing trace with hash -2117710934, now seen corresponding path program 1 times [2019-09-08 04:35:48,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:35:48,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:35:48,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:48,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:35:48,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:35:49,616 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:35:49,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:35:49,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:35:49,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:35:49,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:35:49,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:35:49,618 INFO L87 Difference]: Start difference. First operand 257442 states and 407901 transitions. Second operand 6 states. [2019-09-08 04:36:11,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:36:11,940 INFO L93 Difference]: Finished difference Result 703792 states and 1123193 transitions. [2019-09-08 04:36:11,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:36:11,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 286 [2019-09-08 04:36:11,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:36:14,150 INFO L225 Difference]: With dead ends: 703792 [2019-09-08 04:36:14,150 INFO L226 Difference]: Without dead ends: 517065 [2019-09-08 04:36:14,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:36:15,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517065 states. [2019-09-08 04:36:51,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517065 to 512484. [2019-09-08 04:36:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512484 states. [2019-09-08 04:37:06,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512484 states to 512484 states and 821492 transitions. [2019-09-08 04:37:06,241 INFO L78 Accepts]: Start accepts. Automaton has 512484 states and 821492 transitions. Word has length 286 [2019-09-08 04:37:06,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:37:06,241 INFO L475 AbstractCegarLoop]: Abstraction has 512484 states and 821492 transitions. [2019-09-08 04:37:06,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:37:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 512484 states and 821492 transitions. [2019-09-08 04:37:06,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-08 04:37:06,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:37:06,950 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:37:06,950 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:37:06,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:37:06,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2140873481, now seen corresponding path program 1 times [2019-09-08 04:37:06,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:37:06,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:37:06,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:37:06,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:37:06,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:37:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:37:07,127 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 04:37:07,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:37:07,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:37:07,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:37:07,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:37:07,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:37:07,129 INFO L87 Difference]: Start difference. First operand 512484 states and 821492 transitions. Second operand 8 states. [2019-09-08 04:38:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:38:02,960 INFO L93 Difference]: Finished difference Result 1409413 states and 2282017 transitions. [2019-09-08 04:38:02,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:38:02,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 301 [2019-09-08 04:38:02,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:38:09,070 INFO L225 Difference]: With dead ends: 1409413 [2019-09-08 04:38:09,070 INFO L226 Difference]: Without dead ends: 1037096 [2019-09-08 04:38:10,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:38:11,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037096 states.