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_spec11_product20.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:45:45,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:45:45,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:45:45,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:45:45,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:45:45,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:45:45,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:45:45,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:45:45,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:45:45,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:45:45,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:45:45,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:45:45,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:45:45,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:45:45,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:45:45,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:45:45,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:45:45,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:45:45,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:45:45,044 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:45:45,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:45:45,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:45:45,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:45:45,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:45:45,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:45:45,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:45:45,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:45:45,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:45:45,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:45:45,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:45:45,055 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:45:45,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:45:45,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:45:45,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:45:45,059 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:45:45,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:45:45,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:45:45,060 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:45:45,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:45:45,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:45:45,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:45:45,066 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-10-02 12:45:45,088 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:45:45,088 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:45:45,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:45:45,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:45:45,091 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:45:45,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:45:45,092 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:45:45,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:45:45,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:45:45,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:45:45,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:45:45,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:45:45,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:45:45,095 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:45:45,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:45:45,095 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:45:45,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:45:45,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:45:45,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:45:45,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:45:45,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:45:45,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:45:45,097 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:45:45,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:45:45,098 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:45:45,098 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:45:45,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:45:45,098 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:45:45,099 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:45:45,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:45:45,158 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:45:45,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:45:45,169 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:45:45,169 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:45:45,170 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec11_product20.cil.c [2019-10-02 12:45:45,252 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae991583f/11980984fbaf4499a2e563f21253ce12/FLAG5b376f14a [2019-10-02 12:45:45,960 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:45:45,961 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec11_product20.cil.c [2019-10-02 12:45:45,992 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae991583f/11980984fbaf4499a2e563f21253ce12/FLAG5b376f14a [2019-10-02 12:45:46,191 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae991583f/11980984fbaf4499a2e563f21253ce12 [2019-10-02 12:45:46,203 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:45:46,205 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:45:46,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:45:46,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:45:46,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:45:46,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:45:46" (1/1) ... [2019-10-02 12:45:46,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79976c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:46, skipping insertion in model container [2019-10-02 12:45:46,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:45:46" (1/1) ... [2019-10-02 12:45:46,221 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:45:46,304 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:45:47,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:45:47,132 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:45:47,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:45:47,352 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:45:47,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:47 WrapperNode [2019-10-02 12:45:47,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:45:47,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:45:47,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:45:47,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:45:47,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:47" (1/1) ... [2019-10-02 12:45:47,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:47" (1/1) ... [2019-10-02 12:45:47,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:47" (1/1) ... [2019-10-02 12:45:47,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:47" (1/1) ... [2019-10-02 12:45:47,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:47" (1/1) ... [2019-10-02 12:45:47,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:47" (1/1) ... [2019-10-02 12:45:47,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:47" (1/1) ... [2019-10-02 12:45:47,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:45:47,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:45:47,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:45:47,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:45:47,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:45:47,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:45:47,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:45:47,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:45:47,653 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:45:47,653 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 12:45:47,653 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 12:45:47,654 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 12:45:47,654 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 12:45:47,654 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 12:45:47,654 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 12:45:47,655 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 12:45:47,655 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 12:45:47,655 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:45:47,655 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:45:47,655 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 12:45:47,656 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 12:45:47,656 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 12:45:47,656 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 12:45:47,656 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 12:45:47,658 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 12:45:47,658 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 12:45:47,659 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 12:45:47,659 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 12:45:47,659 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 12:45:47,659 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 12:45:47,659 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 12:45:47,659 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 12:45:47,660 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 12:45:47,660 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 12:45:47,660 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 12:45:47,660 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 12:45:47,660 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 12:45:47,660 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 12:45:47,661 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 12:45:47,661 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 12:45:47,661 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 12:45:47,661 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 12:45:47,661 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 12:45:47,661 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 12:45:47,662 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 12:45:47,662 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 12:45:47,662 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 12:45:47,663 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 12:45:47,663 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 12:45:47,663 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 12:45:47,663 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 12:45:47,664 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 12:45:47,664 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 12:45:47,664 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 12:45:47,664 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 12:45:47,664 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 12:45:47,664 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 12:45:47,665 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 12:45:47,665 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 12:45:47,665 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:45:47,665 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:45:47,665 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:45:47,665 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:45:47,665 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:45:47,665 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:45:47,666 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:45:47,666 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:45:47,666 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:45:47,666 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:45:47,666 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-10-02 12:45:47,666 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 12:45:47,666 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 12:45:47,667 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 12:45:47,667 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 12:45:47,667 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 12:45:47,668 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 12:45:47,668 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 12:45:47,668 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-02 12:45:47,668 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 12:45:47,669 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 12:45:47,669 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 12:45:47,669 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 12:45:47,669 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 12:45:47,670 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 12:45:47,670 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 12:45:47,670 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 12:45:47,670 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 12:45:47,671 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 12:45:47,671 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 12:45:47,671 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 12:45:47,672 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 12:45:47,672 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 12:45:47,673 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 12:45:47,673 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 12:45:47,673 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 12:45:47,674 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 12:45:47,674 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 12:45:47,674 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 12:45:47,674 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 12:45:47,675 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 12:45:47,675 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 12:45:47,675 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 12:45:47,675 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 12:45:47,675 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 12:45:47,675 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 12:45:47,676 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 12:45:47,676 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 12:45:47,676 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 12:45:47,676 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 12:45:47,676 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 12:45:47,676 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 12:45:47,677 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 12:45:47,677 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 12:45:47,677 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 12:45:47,677 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 12:45:47,677 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 12:45:47,677 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:45:47,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:45:47,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:45:47,678 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:45:47,678 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:45:47,679 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 12:45:47,679 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 12:45:47,679 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 12:45:47,679 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 12:45:47,680 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 12:45:47,680 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 12:45:47,680 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 12:45:47,681 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 12:45:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 12:45:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 12:45:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 12:45:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 12:45:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:45:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:45:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:45:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 12:45:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 12:45:47,684 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 12:45:47,684 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 12:45:47,684 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 12:45:47,684 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 12:45:47,684 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 12:45:47,685 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 12:45:47,685 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 12:45:47,689 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 12:45:47,689 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 12:45:47,689 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:45:47,690 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:45:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:45:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 12:45:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 12:45:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 12:45:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 12:45:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 12:45:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 12:45:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 12:45:47,704 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 12:45:47,704 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 12:45:47,705 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 12:45:47,706 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 12:45:47,706 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 12:45:47,706 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 12:45:47,706 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 12:45:47,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:45:47,706 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 12:45:47,707 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 12:45:47,707 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 12:45:47,707 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 12:45:47,707 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 12:45:47,708 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 12:45:47,708 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 12:45:47,708 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 12:45:47,708 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 12:45:47,708 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 12:45:47,708 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 12:45:47,708 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 12:45:47,709 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 12:45:47,709 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 12:45:47,709 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 12:45:47,709 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 12:45:47,709 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 12:45:47,709 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 12:45:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:45:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:45:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:45:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:45:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:45:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:45:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:45:47,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:45:47,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:45:47,711 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:45:47,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:45:47,711 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:45:47,711 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:45:47,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:45:47,711 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:45:47,712 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:45:47,712 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:45:47,712 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 12:45:47,712 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-10-02 12:45:47,712 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 12:45:47,712 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 12:45:47,712 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 12:45:47,713 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 12:45:47,713 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 12:45:47,713 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 12:45:47,713 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 12:45:47,713 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 12:45:47,714 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 12:45:47,714 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 12:45:47,714 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 12:45:47,716 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 12:45:47,716 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 12:45:47,716 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 12:45:47,717 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 12:45:47,717 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 12:45:47,717 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 12:45:47,717 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 12:45:47,717 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 12:45:47,717 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 12:45:47,718 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 12:45:47,718 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-02 12:45:47,718 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 12:45:47,718 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 12:45:47,718 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 12:45:47,718 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 12:45:47,719 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 12:45:47,719 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 12:45:47,719 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 12:45:47,719 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 12:45:47,719 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 12:45:47,719 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 12:45:47,720 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 12:45:47,720 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 12:45:47,720 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 12:45:47,720 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 12:45:47,720 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 12:45:47,720 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 12:45:47,721 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 12:45:47,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:45:47,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:45:47,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:45:50,142 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:45:50,143 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 12:45:50,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:45:50 BoogieIcfgContainer [2019-10-02 12:45:50,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:45:50,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:45:50,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:45:50,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:45:50,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:45:46" (1/3) ... [2019-10-02 12:45:50,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37271cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:45:50, skipping insertion in model container [2019-10-02 12:45:50,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:47" (2/3) ... [2019-10-02 12:45:50,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37271cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:45:50, skipping insertion in model container [2019-10-02 12:45:50,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:45:50" (3/3) ... [2019-10-02 12:45:50,153 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec11_product20.cil.c [2019-10-02 12:45:50,165 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:45:50,175 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:45:50,194 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:45:50,243 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:45:50,243 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:45:50,244 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:45:50,244 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:45:50,244 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:45:50,244 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:45:50,244 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:45:50,244 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:45:50,245 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:45:50,282 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states. [2019-10-02 12:45:50,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 12:45:50,322 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:50,326 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:50,329 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:50,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:50,335 INFO L82 PathProgramCache]: Analyzing trace with hash 598149460, now seen corresponding path program 1 times [2019-10-02 12:45:50,337 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:50,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:50,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:50,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:50,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:51,077 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:45:51,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:51,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 12:45:51,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 12:45:51,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 12:45:51,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:45:51,104 INFO L87 Difference]: Start difference. First operand 556 states. Second operand 2 states. [2019-10-02 12:45:51,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:51,187 INFO L93 Difference]: Finished difference Result 772 states and 1053 transitions. [2019-10-02 12:45:51,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 12:45:51,188 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 193 [2019-10-02 12:45:51,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:51,217 INFO L225 Difference]: With dead ends: 772 [2019-10-02 12:45:51,219 INFO L226 Difference]: Without dead ends: 514 [2019-10-02 12:45:51,232 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:45:51,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-10-02 12:45:51,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2019-10-02 12:45:51,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-10-02 12:45:51,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 704 transitions. [2019-10-02 12:45:51,327 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 704 transitions. Word has length 193 [2019-10-02 12:45:51,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:51,330 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 704 transitions. [2019-10-02 12:45:51,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 12:45:51,330 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 704 transitions. [2019-10-02 12:45:51,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 12:45:51,340 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:51,342 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:51,342 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:51,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:51,343 INFO L82 PathProgramCache]: Analyzing trace with hash -736139474, now seen corresponding path program 1 times [2019-10-02 12:45:51,343 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:51,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:51,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:51,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:51,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:51,673 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:45:51,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:51,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:45:51,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:45:51,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:45:51,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:51,684 INFO L87 Difference]: Start difference. First operand 514 states and 704 transitions. Second operand 3 states. [2019-10-02 12:45:51,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:51,769 INFO L93 Difference]: Finished difference Result 755 states and 1016 transitions. [2019-10-02 12:45:51,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:45:51,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-10-02 12:45:51,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:51,781 INFO L225 Difference]: With dead ends: 755 [2019-10-02 12:45:51,781 INFO L226 Difference]: Without dead ends: 517 [2019-10-02 12:45:51,794 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:51,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-10-02 12:45:51,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 516. [2019-10-02 12:45:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-10-02 12:45:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 706 transitions. [2019-10-02 12:45:51,839 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 706 transitions. Word has length 194 [2019-10-02 12:45:51,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:51,840 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 706 transitions. [2019-10-02 12:45:51,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:45:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 706 transitions. [2019-10-02 12:45:51,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-02 12:45:51,845 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:51,845 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:51,846 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:51,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:51,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1382957214, now seen corresponding path program 1 times [2019-10-02 12:45:51,846 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:51,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:51,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:51,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:51,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:45:52,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:52,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:45:52,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:45:52,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:45:52,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:52,068 INFO L87 Difference]: Start difference. First operand 516 states and 706 transitions. Second operand 3 states. [2019-10-02 12:45:52,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:52,107 INFO L93 Difference]: Finished difference Result 1010 states and 1413 transitions. [2019-10-02 12:45:52,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:45:52,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-10-02 12:45:52,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:52,112 INFO L225 Difference]: With dead ends: 1010 [2019-10-02 12:45:52,112 INFO L226 Difference]: Without dead ends: 559 [2019-10-02 12:45:52,115 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:52,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-10-02 12:45:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 558. [2019-10-02 12:45:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-10-02 12:45:52,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 778 transitions. [2019-10-02 12:45:52,144 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 778 transitions. Word has length 204 [2019-10-02 12:45:52,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:52,145 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 778 transitions. [2019-10-02 12:45:52,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:45:52,145 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 778 transitions. [2019-10-02 12:45:52,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 12:45:52,150 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:52,151 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:52,151 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:52,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:52,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1870197346, now seen corresponding path program 1 times [2019-10-02 12:45:52,152 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:52,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:52,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:52,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:52,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:45:52,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:52,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:45:52,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:45:52,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:45:52,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:52,304 INFO L87 Difference]: Start difference. First operand 558 states and 778 transitions. Second operand 3 states. [2019-10-02 12:45:52,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:52,343 INFO L93 Difference]: Finished difference Result 1133 states and 1624 transitions. [2019-10-02 12:45:52,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:45:52,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-10-02 12:45:52,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:52,349 INFO L225 Difference]: With dead ends: 1133 [2019-10-02 12:45:52,349 INFO L226 Difference]: Without dead ends: 640 [2019-10-02 12:45:52,352 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:52,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-10-02 12:45:52,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 639. [2019-10-02 12:45:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-02 12:45:52,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 916 transitions. [2019-10-02 12:45:52,388 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 916 transitions. Word has length 205 [2019-10-02 12:45:52,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:52,389 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 916 transitions. [2019-10-02 12:45:52,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:45:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 916 transitions. [2019-10-02 12:45:52,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-02 12:45:52,395 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:52,395 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:52,396 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:52,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:52,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1813440642, now seen corresponding path program 1 times [2019-10-02 12:45:52,396 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:52,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:52,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:52,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:52,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:45:52,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:52,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:45:52,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:45:52,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:45:52,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:52,668 INFO L87 Difference]: Start difference. First operand 639 states and 916 transitions. Second operand 3 states. [2019-10-02 12:45:52,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:52,719 INFO L93 Difference]: Finished difference Result 1370 states and 2028 transitions. [2019-10-02 12:45:52,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:45:52,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-10-02 12:45:52,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:52,726 INFO L225 Difference]: With dead ends: 1370 [2019-10-02 12:45:52,726 INFO L226 Difference]: Without dead ends: 796 [2019-10-02 12:45:52,728 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:52,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-10-02 12:45:52,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 795. [2019-10-02 12:45:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-10-02 12:45:52,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1180 transitions. [2019-10-02 12:45:52,775 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1180 transitions. Word has length 206 [2019-10-02 12:45:52,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:52,776 INFO L475 AbstractCegarLoop]: Abstraction has 795 states and 1180 transitions. [2019-10-02 12:45:52,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:45:52,779 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1180 transitions. [2019-10-02 12:45:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 12:45:52,786 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:52,787 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:52,787 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:52,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:52,788 INFO L82 PathProgramCache]: Analyzing trace with hash -786715774, now seen corresponding path program 1 times [2019-10-02 12:45:52,788 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:52,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:52,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:52,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:52,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:52,977 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:45:52,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:52,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:45:52,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:45:52,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:45:52,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:52,979 INFO L87 Difference]: Start difference. First operand 795 states and 1180 transitions. Second operand 3 states. [2019-10-02 12:45:53,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:53,041 INFO L93 Difference]: Finished difference Result 1826 states and 2800 transitions. [2019-10-02 12:45:53,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:45:53,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2019-10-02 12:45:53,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:53,053 INFO L225 Difference]: With dead ends: 1826 [2019-10-02 12:45:53,053 INFO L226 Difference]: Without dead ends: 1096 [2019-10-02 12:45:53,057 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:53,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2019-10-02 12:45:53,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1095. [2019-10-02 12:45:53,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2019-10-02 12:45:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1684 transitions. [2019-10-02 12:45:53,105 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1684 transitions. Word has length 207 [2019-10-02 12:45:53,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:53,106 INFO L475 AbstractCegarLoop]: Abstraction has 1095 states and 1684 transitions. [2019-10-02 12:45:53,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:45:53,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1684 transitions. [2019-10-02 12:45:53,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 12:45:53,114 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:53,115 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:53,115 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:53,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:53,115 INFO L82 PathProgramCache]: Analyzing trace with hash -709603746, now seen corresponding path program 1 times [2019-10-02 12:45:53,115 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:53,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:53,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:53,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:53,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:45:53,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:53,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:45:53,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:45:53,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:45:53,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:53,336 INFO L87 Difference]: Start difference. First operand 1095 states and 1684 transitions. Second operand 3 states. [2019-10-02 12:45:53,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:53,420 INFO L93 Difference]: Finished difference Result 2702 states and 4272 transitions. [2019-10-02 12:45:53,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:45:53,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-10-02 12:45:53,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:53,432 INFO L225 Difference]: With dead ends: 2702 [2019-10-02 12:45:53,432 INFO L226 Difference]: Without dead ends: 1672 [2019-10-02 12:45:53,437 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:53,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2019-10-02 12:45:53,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1671. [2019-10-02 12:45:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2019-10-02 12:45:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2644 transitions. [2019-10-02 12:45:53,529 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2644 transitions. Word has length 208 [2019-10-02 12:45:53,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:53,529 INFO L475 AbstractCegarLoop]: Abstraction has 1671 states and 2644 transitions. [2019-10-02 12:45:53,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:45:53,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2644 transitions. [2019-10-02 12:45:53,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 12:45:53,541 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:53,542 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:53,542 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:53,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:53,543 INFO L82 PathProgramCache]: Analyzing trace with hash 324914454, now seen corresponding path program 1 times [2019-10-02 12:45:53,543 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:53,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:53,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:53,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:53,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:45:53,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:53,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 12:45:54,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:45:54,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:45:54,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:45:54,003 INFO L87 Difference]: Start difference. First operand 1671 states and 2644 transitions. Second operand 19 states. [2019-10-02 12:45:58,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:58,569 INFO L93 Difference]: Finished difference Result 4050 states and 6402 transitions. [2019-10-02 12:45:58,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 12:45:58,570 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 210 [2019-10-02 12:45:58,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:58,606 INFO L225 Difference]: With dead ends: 4050 [2019-10-02 12:45:58,607 INFO L226 Difference]: Without dead ends: 3825 [2019-10-02 12:45:58,613 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 12:45:58,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3825 states. [2019-10-02 12:45:58,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3825 to 3788. [2019-10-02 12:45:58,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3788 states. [2019-10-02 12:45:58,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3788 states and 6041 transitions. [2019-10-02 12:45:58,909 INFO L78 Accepts]: Start accepts. Automaton has 3788 states and 6041 transitions. Word has length 210 [2019-10-02 12:45:58,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:58,912 INFO L475 AbstractCegarLoop]: Abstraction has 3788 states and 6041 transitions. [2019-10-02 12:45:58,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:45:58,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 6041 transitions. [2019-10-02 12:45:58,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-02 12:45:58,939 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:58,940 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:58,940 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:58,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:58,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1251493429, now seen corresponding path program 1 times [2019-10-02 12:45:58,941 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:58,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:58,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:58,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:58,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:59,341 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 12:45:59,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:59,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-02 12:45:59,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 12:45:59,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 12:45:59,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:45:59,343 INFO L87 Difference]: Start difference. First operand 3788 states and 6041 transitions. Second operand 16 states. [2019-10-02 12:45:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:59,858 INFO L93 Difference]: Finished difference Result 4917 states and 7640 transitions. [2019-10-02 12:45:59,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:45:59,858 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 211 [2019-10-02 12:45:59,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:59,886 INFO L225 Difference]: With dead ends: 4917 [2019-10-02 12:45:59,886 INFO L226 Difference]: Without dead ends: 3958 [2019-10-02 12:45:59,893 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-10-02 12:45:59,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3958 states. [2019-10-02 12:46:00,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3958 to 3958. [2019-10-02 12:46:00,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3958 states. [2019-10-02 12:46:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 3958 states and 6293 transitions. [2019-10-02 12:46:00,101 INFO L78 Accepts]: Start accepts. Automaton has 3958 states and 6293 transitions. Word has length 211 [2019-10-02 12:46:00,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:00,102 INFO L475 AbstractCegarLoop]: Abstraction has 3958 states and 6293 transitions. [2019-10-02 12:46:00,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 12:46:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3958 states and 6293 transitions. [2019-10-02 12:46:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-02 12:46:00,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:00,133 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:00,133 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:00,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:00,134 INFO L82 PathProgramCache]: Analyzing trace with hash 39326315, now seen corresponding path program 1 times [2019-10-02 12:46:00,134 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:00,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:00,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:00,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:00,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:00,581 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:46:00,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:00,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 12:46:00,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:46:00,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:46:00,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:46:00,584 INFO L87 Difference]: Start difference. First operand 3958 states and 6293 transitions. Second operand 15 states. [2019-10-02 12:46:05,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:05,061 INFO L93 Difference]: Finished difference Result 5127 states and 7943 transitions. [2019-10-02 12:46:05,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 12:46:05,063 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 211 [2019-10-02 12:46:05,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:05,101 INFO L225 Difference]: With dead ends: 5127 [2019-10-02 12:46:05,102 INFO L226 Difference]: Without dead ends: 4058 [2019-10-02 12:46:05,108 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 12:46:05,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2019-10-02 12:46:05,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 4028. [2019-10-02 12:46:05,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4028 states. [2019-10-02 12:46:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4028 states to 4028 states and 6404 transitions. [2019-10-02 12:46:05,307 INFO L78 Accepts]: Start accepts. Automaton has 4028 states and 6404 transitions. Word has length 211 [2019-10-02 12:46:05,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:05,308 INFO L475 AbstractCegarLoop]: Abstraction has 4028 states and 6404 transitions. [2019-10-02 12:46:05,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:46:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 4028 states and 6404 transitions. [2019-10-02 12:46:05,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-02 12:46:05,331 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:05,331 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:05,332 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:05,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:05,333 INFO L82 PathProgramCache]: Analyzing trace with hash -671262686, now seen corresponding path program 1 times [2019-10-02 12:46:05,333 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:05,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:05,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:05,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:05,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:05,535 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:46:05,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:05,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:46:05,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:46:05,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:46:05,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:46:05,537 INFO L87 Difference]: Start difference. First operand 4028 states and 6404 transitions. Second operand 5 states. [2019-10-02 12:46:06,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:06,515 INFO L93 Difference]: Finished difference Result 7749 states and 12158 transitions. [2019-10-02 12:46:06,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:46:06,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 211 [2019-10-02 12:46:06,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:06,565 INFO L225 Difference]: With dead ends: 7749 [2019-10-02 12:46:06,565 INFO L226 Difference]: Without dead ends: 7174 [2019-10-02 12:46:06,573 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:46:06,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7174 states. [2019-10-02 12:46:06,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7174 to 7156. [2019-10-02 12:46:06,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7156 states. [2019-10-02 12:46:06,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7156 states to 7156 states and 11339 transitions. [2019-10-02 12:46:06,943 INFO L78 Accepts]: Start accepts. Automaton has 7156 states and 11339 transitions. Word has length 211 [2019-10-02 12:46:06,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:06,945 INFO L475 AbstractCegarLoop]: Abstraction has 7156 states and 11339 transitions. [2019-10-02 12:46:06,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:46:06,945 INFO L276 IsEmpty]: Start isEmpty. Operand 7156 states and 11339 transitions. [2019-10-02 12:46:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-02 12:46:06,977 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:06,977 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:06,977 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:06,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:06,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1154938013, now seen corresponding path program 1 times [2019-10-02 12:46:06,978 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:06,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:06,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:06,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:06,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:07,193 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:46:07,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:07,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:46:07,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:46:07,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:46:07,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:46:07,196 INFO L87 Difference]: Start difference. First operand 7156 states and 11339 transitions. Second operand 7 states. [2019-10-02 12:46:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:09,148 INFO L93 Difference]: Finished difference Result 15881 states and 25146 transitions. [2019-10-02 12:46:09,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:46:09,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 211 [2019-10-02 12:46:09,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:09,244 INFO L225 Difference]: With dead ends: 15881 [2019-10-02 12:46:09,244 INFO L226 Difference]: Without dead ends: 13026 [2019-10-02 12:46:09,272 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:46:09,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13026 states. [2019-10-02 12:46:09,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13026 to 13020. [2019-10-02 12:46:09,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13020 states. [2019-10-02 12:46:10,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 20697 transitions. [2019-10-02 12:46:10,003 INFO L78 Accepts]: Start accepts. Automaton has 13020 states and 20697 transitions. Word has length 211 [2019-10-02 12:46:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:10,004 INFO L475 AbstractCegarLoop]: Abstraction has 13020 states and 20697 transitions. [2019-10-02 12:46:10,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:46:10,004 INFO L276 IsEmpty]: Start isEmpty. Operand 13020 states and 20697 transitions. [2019-10-02 12:46:10,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 12:46:10,045 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:10,045 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:10,046 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:10,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:10,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1728661351, now seen corresponding path program 1 times [2019-10-02 12:46:10,046 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:10,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:10,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:10,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:10,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:46:10,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:10,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 12:46:10,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:46:10,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:46:10,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:46:10,509 INFO L87 Difference]: Start difference. First operand 13020 states and 20697 transitions. Second operand 26 states. [2019-10-02 12:46:11,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:11,854 INFO L93 Difference]: Finished difference Result 22920 states and 36507 transitions. [2019-10-02 12:46:11,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:46:11,855 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 212 [2019-10-02 12:46:11,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:11,932 INFO L225 Difference]: With dead ends: 22920 [2019-10-02 12:46:11,932 INFO L226 Difference]: Without dead ends: 14201 [2019-10-02 12:46:11,974 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 12:46:11,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14201 states. [2019-10-02 12:46:12,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14201 to 14180. [2019-10-02 12:46:12,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14180 states. [2019-10-02 12:46:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14180 states to 14180 states and 22394 transitions. [2019-10-02 12:46:12,573 INFO L78 Accepts]: Start accepts. Automaton has 14180 states and 22394 transitions. Word has length 212 [2019-10-02 12:46:12,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:12,574 INFO L475 AbstractCegarLoop]: Abstraction has 14180 states and 22394 transitions. [2019-10-02 12:46:12,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:46:12,574 INFO L276 IsEmpty]: Start isEmpty. Operand 14180 states and 22394 transitions. [2019-10-02 12:46:12,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 12:46:12,596 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:12,596 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:12,597 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:12,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:12,597 INFO L82 PathProgramCache]: Analyzing trace with hash -925986545, now seen corresponding path program 1 times [2019-10-02 12:46:12,597 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:12,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:12,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:12,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:12,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:12,837 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:46:12,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:12,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:46:12,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:46:12,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:46:12,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:46:12,840 INFO L87 Difference]: Start difference. First operand 14180 states and 22394 transitions. Second operand 10 states. [2019-10-02 12:46:13,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:13,196 INFO L93 Difference]: Finished difference Result 14303 states and 22546 transitions. [2019-10-02 12:46:13,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:46:13,197 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 216 [2019-10-02 12:46:13,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:13,271 INFO L225 Difference]: With dead ends: 14303 [2019-10-02 12:46:13,272 INFO L226 Difference]: Without dead ends: 14300 [2019-10-02 12:46:13,286 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:46:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14300 states. [2019-10-02 12:46:14,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14300 to 14300. [2019-10-02 12:46:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14300 states. [2019-10-02 12:46:14,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14300 states to 14300 states and 22504 transitions. [2019-10-02 12:46:14,322 INFO L78 Accepts]: Start accepts. Automaton has 14300 states and 22504 transitions. Word has length 216 [2019-10-02 12:46:14,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:14,323 INFO L475 AbstractCegarLoop]: Abstraction has 14300 states and 22504 transitions. [2019-10-02 12:46:14,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:46:14,323 INFO L276 IsEmpty]: Start isEmpty. Operand 14300 states and 22504 transitions. [2019-10-02 12:46:14,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-02 12:46:14,346 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:14,346 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:14,347 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:14,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:14,347 INFO L82 PathProgramCache]: Analyzing trace with hash -17024576, now seen corresponding path program 1 times [2019-10-02 12:46:14,347 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:14,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:14,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:14,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:14,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:14,493 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:46:14,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:14,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:46:14,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:46:14,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:46:14,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:46:14,495 INFO L87 Difference]: Start difference. First operand 14300 states and 22504 transitions. Second operand 5 states. [2019-10-02 12:46:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:14,802 INFO L93 Difference]: Finished difference Result 24362 states and 38491 transitions. [2019-10-02 12:46:14,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:46:14,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 221 [2019-10-02 12:46:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:14,879 INFO L225 Difference]: With dead ends: 24362 [2019-10-02 12:46:14,880 INFO L226 Difference]: Without dead ends: 14741 [2019-10-02 12:46:14,931 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:46:14,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14741 states. [2019-10-02 12:46:15,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14741 to 14510. [2019-10-02 12:46:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14510 states. [2019-10-02 12:46:15,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14510 states to 14510 states and 22750 transitions. [2019-10-02 12:46:15,863 INFO L78 Accepts]: Start accepts. Automaton has 14510 states and 22750 transitions. Word has length 221 [2019-10-02 12:46:15,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:15,865 INFO L475 AbstractCegarLoop]: Abstraction has 14510 states and 22750 transitions. [2019-10-02 12:46:15,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:46:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 14510 states and 22750 transitions. [2019-10-02 12:46:15,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-02 12:46:15,888 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:15,889 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:15,889 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:15,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:15,889 INFO L82 PathProgramCache]: Analyzing trace with hash 2066975880, now seen corresponding path program 1 times [2019-10-02 12:46:15,889 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:15,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:15,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:15,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:15,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:16,109 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:46:16,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:16,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:46:16,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:46:16,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:46:16,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:46:16,114 INFO L87 Difference]: Start difference. First operand 14510 states and 22750 transitions. Second operand 11 states. [2019-10-02 12:46:16,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:16,748 INFO L93 Difference]: Finished difference Result 24407 states and 37619 transitions. [2019-10-02 12:46:16,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:46:16,749 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 221 [2019-10-02 12:46:16,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:16,828 INFO L225 Difference]: With dead ends: 24407 [2019-10-02 12:46:16,828 INFO L226 Difference]: Without dead ends: 14576 [2019-10-02 12:46:16,864 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:46:16,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14576 states. [2019-10-02 12:46:17,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14576 to 14558. [2019-10-02 12:46:17,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14558 states. [2019-10-02 12:46:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14558 states to 14558 states and 22770 transitions. [2019-10-02 12:46:17,631 INFO L78 Accepts]: Start accepts. Automaton has 14558 states and 22770 transitions. Word has length 221 [2019-10-02 12:46:17,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:17,632 INFO L475 AbstractCegarLoop]: Abstraction has 14558 states and 22770 transitions. [2019-10-02 12:46:17,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:46:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 14558 states and 22770 transitions. [2019-10-02 12:46:17,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 12:46:17,660 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:17,661 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:17,661 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:17,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:17,662 INFO L82 PathProgramCache]: Analyzing trace with hash -627713257, now seen corresponding path program 1 times [2019-10-02 12:46:17,662 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:17,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:17,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:17,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:17,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:46:18,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:18,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:46:18,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:46:18,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:46:18,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:46:18,670 INFO L87 Difference]: Start difference. First operand 14558 states and 22770 transitions. Second operand 6 states. [2019-10-02 12:46:19,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:19,631 INFO L93 Difference]: Finished difference Result 39589 states and 63143 transitions. [2019-10-02 12:46:19,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:46:19,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 222 [2019-10-02 12:46:19,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:19,782 INFO L225 Difference]: With dead ends: 39589 [2019-10-02 12:46:19,782 INFO L226 Difference]: Without dead ends: 29434 [2019-10-02 12:46:19,844 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:46:19,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29434 states. [2019-10-02 12:46:21,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29434 to 28979. [2019-10-02 12:46:21,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28979 states. [2019-10-02 12:46:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28979 states to 28979 states and 46021 transitions. [2019-10-02 12:46:21,309 INFO L78 Accepts]: Start accepts. Automaton has 28979 states and 46021 transitions. Word has length 222 [2019-10-02 12:46:21,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:21,310 INFO L475 AbstractCegarLoop]: Abstraction has 28979 states and 46021 transitions. [2019-10-02 12:46:21,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:46:21,310 INFO L276 IsEmpty]: Start isEmpty. Operand 28979 states and 46021 transitions. [2019-10-02 12:46:21,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-02 12:46:21,361 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:21,361 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:21,361 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:21,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:21,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1741723880, now seen corresponding path program 1 times [2019-10-02 12:46:21,362 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:21,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:21,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:21,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:21,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:46:21,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:21,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:46:21,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:46:21,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:46:21,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:46:21,572 INFO L87 Difference]: Start difference. First operand 28979 states and 46021 transitions. Second operand 8 states. [2019-10-02 12:46:27,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:27,420 INFO L93 Difference]: Finished difference Result 87551 states and 147265 transitions. [2019-10-02 12:46:27,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:46:27,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 243 [2019-10-02 12:46:27,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:27,818 INFO L225 Difference]: With dead ends: 87551 [2019-10-02 12:46:27,819 INFO L226 Difference]: Without dead ends: 58637 [2019-10-02 12:46:27,968 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:46:28,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58637 states. [2019-10-02 12:46:31,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58637 to 37811. [2019-10-02 12:46:31,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37811 states. [2019-10-02 12:46:31,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37811 states to 37811 states and 66067 transitions. [2019-10-02 12:46:31,565 INFO L78 Accepts]: Start accepts. Automaton has 37811 states and 66067 transitions. Word has length 243 [2019-10-02 12:46:31,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:31,566 INFO L475 AbstractCegarLoop]: Abstraction has 37811 states and 66067 transitions. [2019-10-02 12:46:31,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:46:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 37811 states and 66067 transitions. [2019-10-02 12:46:31,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-02 12:46:31,656 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:31,656 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:31,656 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:31,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:31,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1665358554, now seen corresponding path program 1 times [2019-10-02 12:46:31,657 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:31,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:31,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:31,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:31,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:46:31,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:31,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:46:31,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:46:31,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:46:31,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:46:31,887 INFO L87 Difference]: Start difference. First operand 37811 states and 66067 transitions. Second operand 8 states. [2019-10-02 12:46:40,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:40,136 INFO L93 Difference]: Finished difference Result 114851 states and 216919 transitions. [2019-10-02 12:46:40,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:46:40,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 244 [2019-10-02 12:46:40,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:40,656 INFO L225 Difference]: With dead ends: 114851 [2019-10-02 12:46:40,657 INFO L226 Difference]: Without dead ends: 77105 [2019-10-02 12:46:40,818 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:46:40,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77105 states. [2019-10-02 12:46:43,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77105 to 55655. [2019-10-02 12:46:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55655 states. [2019-10-02 12:46:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55655 states to 55655 states and 110491 transitions. [2019-10-02 12:46:44,029 INFO L78 Accepts]: Start accepts. Automaton has 55655 states and 110491 transitions. Word has length 244 [2019-10-02 12:46:44,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:44,029 INFO L475 AbstractCegarLoop]: Abstraction has 55655 states and 110491 transitions. [2019-10-02 12:46:44,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:46:44,030 INFO L276 IsEmpty]: Start isEmpty. Operand 55655 states and 110491 transitions. [2019-10-02 12:46:44,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-02 12:46:44,280 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:44,280 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:44,280 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:44,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:44,281 INFO L82 PathProgramCache]: Analyzing trace with hash 946642852, now seen corresponding path program 1 times [2019-10-02 12:46:44,281 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:44,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:44,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:44,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:44,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:46:44,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:44,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:46:44,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:46:44,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:46:44,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:46:44,484 INFO L87 Difference]: Start difference. First operand 55655 states and 110491 transitions. Second operand 8 states. [2019-10-02 12:46:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:54,869 INFO L93 Difference]: Finished difference Result 169859 states and 369157 transitions. [2019-10-02 12:46:54,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:46:54,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 245 [2019-10-02 12:46:54,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:55,685 INFO L225 Difference]: With dead ends: 169859 [2019-10-02 12:46:55,685 INFO L226 Difference]: Without dead ends: 114269 [2019-10-02 12:46:55,927 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:46:56,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114269 states. [2019-10-02 12:47:04,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114269 to 91535. [2019-10-02 12:47:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91535 states. [2019-10-02 12:47:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91535 states to 91535 states and 207793 transitions. [2019-10-02 12:47:05,134 INFO L78 Accepts]: Start accepts. Automaton has 91535 states and 207793 transitions. Word has length 245 [2019-10-02 12:47:05,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:05,135 INFO L475 AbstractCegarLoop]: Abstraction has 91535 states and 207793 transitions. [2019-10-02 12:47:05,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:47:05,135 INFO L276 IsEmpty]: Start isEmpty. Operand 91535 states and 207793 transitions. [2019-10-02 12:47:05,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-02 12:47:05,608 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:05,608 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:05,608 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:05,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:05,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1829537673, now seen corresponding path program 1 times [2019-10-02 12:47:05,609 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:05,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:05,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:05,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:05,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:05,811 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:47:05,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:47:05,811 INFO L224 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-10-02 12:47:05,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:06,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 2959 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:47:06,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:47:06,641 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:47:06,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:47:06,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2019-10-02 12:47:06,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:47:06,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:47:06,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:47:06,653 INFO L87 Difference]: Start difference. First operand 91535 states and 207793 transitions. Second operand 13 states. [2019-10-02 12:47:13,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:13,093 INFO L93 Difference]: Finished difference Result 188932 states and 425661 transitions. [2019-10-02 12:47:13,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:47:13,094 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 241 [2019-10-02 12:47:13,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:18,486 INFO L225 Difference]: With dead ends: 188932 [2019-10-02 12:47:18,486 INFO L226 Difference]: Without dead ends: 97331 [2019-10-02 12:47:19,229 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:47:19,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97331 states. [2019-10-02 12:47:26,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97331 to 96978. [2019-10-02 12:47:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96978 states. [2019-10-02 12:47:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96978 states to 96978 states and 215462 transitions. [2019-10-02 12:47:27,704 INFO L78 Accepts]: Start accepts. Automaton has 96978 states and 215462 transitions. Word has length 241 [2019-10-02 12:47:27,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:27,705 INFO L475 AbstractCegarLoop]: Abstraction has 96978 states and 215462 transitions. [2019-10-02 12:47:27,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:47:27,705 INFO L276 IsEmpty]: Start isEmpty. Operand 96978 states and 215462 transitions. [2019-10-02 12:47:28,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-10-02 12:47:28,291 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:28,291 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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-10-02 12:47:28,291 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:28,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:28,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1824164050, now seen corresponding path program 1 times [2019-10-02 12:47:28,292 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:28,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:28,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:28,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:28,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:28,584 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 12:47:28,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:28,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:47:28,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:47:28,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:47:28,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:47:28,586 INFO L87 Difference]: Start difference. First operand 96978 states and 215462 transitions. Second operand 6 states. [2019-10-02 12:47:39,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:39,265 INFO L93 Difference]: Finished difference Result 220630 states and 475409 transitions. [2019-10-02 12:47:39,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:47:39,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 267 [2019-10-02 12:47:39,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:40,480 INFO L225 Difference]: With dead ends: 220630 [2019-10-02 12:47:40,480 INFO L226 Difference]: Without dead ends: 194897 [2019-10-02 12:47:40,594 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:47:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194897 states. [2019-10-02 12:47:54,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194897 to 194614. [2019-10-02 12:47:54,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194614 states. [2019-10-02 12:47:55,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194614 states to 194614 states and 432657 transitions. [2019-10-02 12:47:55,327 INFO L78 Accepts]: Start accepts. Automaton has 194614 states and 432657 transitions. Word has length 267 [2019-10-02 12:47:55,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:55,328 INFO L475 AbstractCegarLoop]: Abstraction has 194614 states and 432657 transitions. [2019-10-02 12:47:55,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:47:55,328 INFO L276 IsEmpty]: Start isEmpty. Operand 194614 states and 432657 transitions. [2019-10-02 12:48:03,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-10-02 12:48:03,877 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:48:03,878 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-10-02 12:48:03,878 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:48:03,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:48:03,878 INFO L82 PathProgramCache]: Analyzing trace with hash -15923955, now seen corresponding path program 1 times [2019-10-02 12:48:03,878 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:48:03,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:48:03,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:03,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:48:03,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:48:04,287 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:48:04,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:48:04,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 12:48:04,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:48:04,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:48:04,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:48:04,291 INFO L87 Difference]: Start difference. First operand 194614 states and 432657 transitions. Second operand 19 states. [2019-10-02 12:48:18,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:48:18,749 INFO L93 Difference]: Finished difference Result 306799 states and 651097 transitions. [2019-10-02 12:48:18,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 12:48:18,750 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 267 [2019-10-02 12:48:18,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:48:20,940 INFO L225 Difference]: With dead ends: 306799 [2019-10-02 12:48:20,941 INFO L226 Difference]: Without dead ends: 286247 [2019-10-02 12:48:21,181 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=214, Invalid=2042, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 12:48:22,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286247 states. [2019-10-02 12:48:53,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286247 to 285014. [2019-10-02 12:48:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285014 states. [2019-10-02 12:48:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285014 states to 285014 states and 615403 transitions. [2019-10-02 12:48:54,677 INFO L78 Accepts]: Start accepts. Automaton has 285014 states and 615403 transitions. Word has length 267 [2019-10-02 12:48:54,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:48:54,678 INFO L475 AbstractCegarLoop]: Abstraction has 285014 states and 615403 transitions. [2019-10-02 12:48:54,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:48:54,678 INFO L276 IsEmpty]: Start isEmpty. Operand 285014 states and 615403 transitions. [2019-10-02 12:48:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-02 12:48:57,015 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:48:57,015 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-10-02 12:48:57,015 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:48:57,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:48:57,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1305964649, now seen corresponding path program 1 times [2019-10-02 12:48:57,016 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:48:57,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:48:57,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:57,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:48:57,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:48:57,218 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:48:57,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:48:57,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:48:57,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:48:57,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:48:57,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:48:57,220 INFO L87 Difference]: Start difference. First operand 285014 states and 615403 transitions. Second operand 7 states. [2019-10-02 12:49:38,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:49:38,992 INFO L93 Difference]: Finished difference Result 617730 states and 1537851 transitions. [2019-10-02 12:49:38,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:49:38,992 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 252 [2019-10-02 12:49:38,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:49:43,570 INFO L225 Difference]: With dead ends: 617730 [2019-10-02 12:49:43,571 INFO L226 Difference]: Without dead ends: 570876 [2019-10-02 12:49:43,881 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:49:44,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570876 states. [2019-10-02 12:50:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570876 to 557282. [2019-10-02 12:50:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557282 states. [2019-10-02 12:51:04,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557282 states to 557282 states and 1440586 transitions. [2019-10-02 12:51:04,806 INFO L78 Accepts]: Start accepts. Automaton has 557282 states and 1440586 transitions. Word has length 252 [2019-10-02 12:51:04,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:51:04,807 INFO L475 AbstractCegarLoop]: Abstraction has 557282 states and 1440586 transitions. [2019-10-02 12:51:04,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:51:04,807 INFO L276 IsEmpty]: Start isEmpty. Operand 557282 states and 1440586 transitions.