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-112bae1 [2019-09-08 04:32:27,695 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:32:27,697 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:32:27,710 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:32:27,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:32:27,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:32:27,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:32:27,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:32:27,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:32:27,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:32:27,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:32:27,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:32:27,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:32:27,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:32:27,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:32:27,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:32:27,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:32:27,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:32:27,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:32:27,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:32:27,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:32:27,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:32:27,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:32:27,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:32:27,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:32:27,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:32:27,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:32:27,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:32:27,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:32:27,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:32:27,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:32:27,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:32:27,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:32:27,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:32:27,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:32:27,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:32:27,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:32:27,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:32:27,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:32:27,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:32:27,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:32:27,745 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 04:32:27,765 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:32:27,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:32:27,770 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:32:27,770 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:32:27,771 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:32:27,771 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:32:27,771 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:32:27,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:32:27,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:32:27,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:32:27,772 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:32:27,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:32:27,772 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:32:27,772 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:32:27,772 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:32:27,773 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:32:27,773 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:32:27,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:32:27,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:32:27,773 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:32:27,774 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:32:27,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:32:27,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:32:27,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:32:27,774 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:32:27,775 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:32:27,775 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:32:27,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:32:27,775 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:32:27,804 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:32:27,822 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:32:27,826 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:32:27,828 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:32:27,828 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:32:27,829 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-09-08 04:32:27,908 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a37f91fb6/1e24e562bca44a91a2f78641f2332609/FLAGe0d47359c [2019-09-08 04:32:28,603 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:32:28,606 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec11_product20.cil.c [2019-09-08 04:32:28,628 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a37f91fb6/1e24e562bca44a91a2f78641f2332609/FLAGe0d47359c [2019-09-08 04:32:28,792 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a37f91fb6/1e24e562bca44a91a2f78641f2332609 [2019-09-08 04:32:28,802 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:32:28,804 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:32:28,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:32:28,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:32:28,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:32:28,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:32:28" (1/1) ... [2019-09-08 04:32:28,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3feaa52d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:28, skipping insertion in model container [2019-09-08 04:32:28,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:32:28" (1/1) ... [2019-09-08 04:32:28,818 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:32:28,909 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:32:29,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:32:29,801 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:32:29,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:32:30,043 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:32:30,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:30 WrapperNode [2019-09-08 04:32:30,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:32:30,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:32:30,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:32:30,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:32:30,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:30" (1/1) ... [2019-09-08 04:32:30,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:30" (1/1) ... [2019-09-08 04:32:30,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:30" (1/1) ... [2019-09-08 04:32:30,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:30" (1/1) ... [2019-09-08 04:32:30,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:30" (1/1) ... [2019-09-08 04:32:30,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:30" (1/1) ... [2019-09-08 04:32:30,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:30" (1/1) ... [2019-09-08 04:32:30,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:32:30,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:32:30,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:32:30,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:32:30,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:32:30,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:32:30,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:32:30,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:32:30,276 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:32:30,276 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 04:32:30,276 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 04:32:30,276 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 04:32:30,276 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 04:32:30,277 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 04:32:30,277 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 04:32:30,277 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 04:32:30,277 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 04:32:30,277 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:32:30,278 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:32:30,278 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 04:32:30,278 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 04:32:30,278 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 04:32:30,279 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 04:32:30,279 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 04:32:30,279 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 04:32:30,280 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 04:32:30,280 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 04:32:30,280 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 04:32:30,280 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 04:32:30,280 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 04:32:30,281 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 04:32:30,281 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 04:32:30,281 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 04:32:30,281 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 04:32:30,281 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 04:32:30,281 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 04:32:30,281 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 04:32:30,282 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 04:32:30,282 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 04:32:30,282 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 04:32:30,282 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 04:32:30,282 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 04:32:30,282 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 04:32:30,283 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 04:32:30,283 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 04:32:30,283 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 04:32:30,283 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 04:32:30,283 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 04:32:30,283 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 04:32:30,284 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 04:32:30,284 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 04:32:30,284 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 04:32:30,284 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 04:32:30,284 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 04:32:30,284 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 04:32:30,285 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 04:32:30,285 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 04:32:30,285 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 04:32:30,285 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 04:32:30,285 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:32:30,285 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:32:30,286 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:32:30,286 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:32:30,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:32:30,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:32:30,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:32:30,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:32:30,287 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:32:30,287 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:32:30,287 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-09-08 04:32:30,287 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 04:32:30,287 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 04:32:30,288 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 04:32:30,288 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-08 04:32:30,288 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 04:32:30,288 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 04:32:30,288 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 04:32:30,288 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-09-08 04:32:30,289 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 04:32:30,289 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 04:32:30,289 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 04:32:30,289 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 04:32:30,289 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 04:32:30,289 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 04:32:30,289 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 04:32:30,290 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 04:32:30,290 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 04:32:30,290 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 04:32:30,290 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 04:32:30,290 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 04:32:30,290 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 04:32:30,291 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 04:32:30,291 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 04:32:30,291 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 04:32:30,291 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 04:32:30,291 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 04:32:30,291 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 04:32:30,291 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 04:32:30,292 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 04:32:30,292 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 04:32:30,292 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 04:32:30,292 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 04:32:30,292 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 04:32:30,292 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 04:32:30,293 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 04:32:30,293 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 04:32:30,293 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 04:32:30,293 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 04:32:30,293 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 04:32:30,293 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 04:32:30,293 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 04:32:30,294 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 04:32:30,294 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 04:32:30,294 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 04:32:30,294 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 04:32:30,294 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 04:32:30,294 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:32:30,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:32:30,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:32:30,295 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:32:30,295 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:32:30,295 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 04:32:30,295 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 04:32:30,295 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 04:32:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 04:32:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 04:32:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 04:32:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 04:32:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 04:32:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 04:32:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 04:32:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 04:32:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 04:32:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:32:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:32:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:32:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 04:32:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 04:32:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 04:32:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 04:32:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 04:32:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 04:32:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 04:32:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 04:32:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 04:32:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 04:32:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 04:32:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:32:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:32:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:32:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 04:32:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 04:32:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 04:32:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 04:32:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 04:32:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 04:32:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 04:32:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 04:32:30,301 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 04:32:30,301 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 04:32:30,301 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 04:32:30,301 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 04:32:30,301 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 04:32:30,301 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 04:32:30,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:32:30,302 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 04:32:30,302 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 04:32:30,302 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 04:32:30,302 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 04:32:30,302 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 04:32:30,302 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 04:32:30,302 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 04:32:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 04:32:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 04:32:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 04:32:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 04:32:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 04:32:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 04:32:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 04:32:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 04:32:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 04:32:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 04:32:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 04:32:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:32:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:32:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:32:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:32:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:32:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:32:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:32:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:32:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:32:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:32:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:32:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:32:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:32:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:32:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:32:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:32:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:32:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 04:32:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-09-08 04:32:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 04:32:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 04:32:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 04:32:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 04:32:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 04:32:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 04:32:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 04:32:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 04:32:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 04:32:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 04:32:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 04:32:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 04:32:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 04:32:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 04:32:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 04:32:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 04:32:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 04:32:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 04:32:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 04:32:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-08 04:32:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 04:32:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-09-08 04:32:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 04:32:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 04:32:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 04:32:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 04:32:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 04:32:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 04:32:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 04:32:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 04:32:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 04:32:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 04:32:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 04:32:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 04:32:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 04:32:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 04:32:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 04:32:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 04:32:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 04:32:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:32:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:32:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:32:32,412 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:32:32,412 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 04:32:32,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:32:32 BoogieIcfgContainer [2019-09-08 04:32:32,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:32:32,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:32:32,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:32:32,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:32:32,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:32:28" (1/3) ... [2019-09-08 04:32:32,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213951d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:32:32, skipping insertion in model container [2019-09-08 04:32:32,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:32:30" (2/3) ... [2019-09-08 04:32:32,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213951d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:32:32, skipping insertion in model container [2019-09-08 04:32:32,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:32:32" (3/3) ... [2019-09-08 04:32:32,423 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec11_product20.cil.c [2019-09-08 04:32:32,434 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:32:32,445 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:32:32,463 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:32:32,519 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:32:32,520 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:32:32,520 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:32:32,520 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:32:32,521 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:32:32,521 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:32:32,521 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:32:32,521 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:32:32,521 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:32:32,560 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states. [2019-09-08 04:32:32,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 04:32:32,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:32,597 INFO L399 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-09-08 04:32:32,600 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:32,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:32,606 INFO L82 PathProgramCache]: Analyzing trace with hash 598149460, now seen corresponding path program 1 times [2019-09-08 04:32:32,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:32,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:32,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:32,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:32,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:33,361 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:32:33,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:33,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 04:32:33,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 04:32:33,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 04:32:33,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:32:33,392 INFO L87 Difference]: Start difference. First operand 556 states. Second operand 2 states. [2019-09-08 04:32:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:33,493 INFO L93 Difference]: Finished difference Result 772 states and 1053 transitions. [2019-09-08 04:32:33,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 04:32:33,494 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 193 [2019-09-08 04:32:33,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:33,522 INFO L225 Difference]: With dead ends: 772 [2019-09-08 04:32:33,522 INFO L226 Difference]: Without dead ends: 514 [2019-09-08 04:32:33,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:32:33,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-09-08 04:32:33,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2019-09-08 04:32:33,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-09-08 04:32:33,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 704 transitions. [2019-09-08 04:32:33,622 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 704 transitions. Word has length 193 [2019-09-08 04:32:33,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:33,624 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 704 transitions. [2019-09-08 04:32:33,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 04:32:33,625 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 704 transitions. [2019-09-08 04:32:33,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-08 04:32:33,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:33,632 INFO L399 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-09-08 04:32:33,632 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:33,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:33,633 INFO L82 PathProgramCache]: Analyzing trace with hash -736139474, now seen corresponding path program 1 times [2019-09-08 04:32:33,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:33,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:33,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:33,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:33,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:33,857 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:32:33,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:33,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:32:33,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:32:33,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:32:33,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:33,864 INFO L87 Difference]: Start difference. First operand 514 states and 704 transitions. Second operand 3 states. [2019-09-08 04:32:33,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:33,935 INFO L93 Difference]: Finished difference Result 755 states and 1016 transitions. [2019-09-08 04:32:33,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:32:33,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-09-08 04:32:33,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:33,946 INFO L225 Difference]: With dead ends: 755 [2019-09-08 04:32:33,946 INFO L226 Difference]: Without dead ends: 517 [2019-09-08 04:32:33,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:33,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-09-08 04:32:34,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 516. [2019-09-08 04:32:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-09-08 04:32:34,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 706 transitions. [2019-09-08 04:32:34,014 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 706 transitions. Word has length 194 [2019-09-08 04:32:34,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:34,015 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 706 transitions. [2019-09-08 04:32:34,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:32:34,015 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 706 transitions. [2019-09-08 04:32:34,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 04:32:34,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:34,021 INFO L399 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-09-08 04:32:34,021 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:34,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:34,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1382957214, now seen corresponding path program 1 times [2019-09-08 04:32:34,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:34,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:34,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:34,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:34,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:32:34,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:34,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:32:34,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:32:34,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:32:34,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:34,319 INFO L87 Difference]: Start difference. First operand 516 states and 706 transitions. Second operand 3 states. [2019-09-08 04:32:34,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:34,384 INFO L93 Difference]: Finished difference Result 1010 states and 1413 transitions. [2019-09-08 04:32:34,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:32:34,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-08 04:32:34,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:34,392 INFO L225 Difference]: With dead ends: 1010 [2019-09-08 04:32:34,393 INFO L226 Difference]: Without dead ends: 559 [2019-09-08 04:32:34,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:34,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-08 04:32:34,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 558. [2019-09-08 04:32:34,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-09-08 04:32:34,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 778 transitions. [2019-09-08 04:32:34,456 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 778 transitions. Word has length 204 [2019-09-08 04:32:34,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:34,457 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 778 transitions. [2019-09-08 04:32:34,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:32:34,458 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 778 transitions. [2019-09-08 04:32:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 04:32:34,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:34,466 INFO L399 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-09-08 04:32:34,467 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:34,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:34,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1870197346, now seen corresponding path program 1 times [2019-09-08 04:32:34,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:34,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:34,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:34,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:34,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:34,688 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:32:34,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:34,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:32:34,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:32:34,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:32:34,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:34,690 INFO L87 Difference]: Start difference. First operand 558 states and 778 transitions. Second operand 3 states. [2019-09-08 04:32:34,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:34,736 INFO L93 Difference]: Finished difference Result 1133 states and 1624 transitions. [2019-09-08 04:32:34,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:32:34,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-09-08 04:32:34,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:34,746 INFO L225 Difference]: With dead ends: 1133 [2019-09-08 04:32:34,746 INFO L226 Difference]: Without dead ends: 640 [2019-09-08 04:32:34,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:34,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-09-08 04:32:34,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 639. [2019-09-08 04:32:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 04:32:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 916 transitions. [2019-09-08 04:32:34,795 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 916 transitions. Word has length 205 [2019-09-08 04:32:34,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:34,796 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 916 transitions. [2019-09-08 04:32:34,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:32:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 916 transitions. [2019-09-08 04:32:34,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-08 04:32:34,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:34,802 INFO L399 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-09-08 04:32:34,802 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:34,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:34,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1813440642, now seen corresponding path program 1 times [2019-09-08 04:32:34,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:34,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:34,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:34,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:34,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:35,061 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:32:35,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:35,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:32:35,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:32:35,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:32:35,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:35,063 INFO L87 Difference]: Start difference. First operand 639 states and 916 transitions. Second operand 3 states. [2019-09-08 04:32:35,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:35,112 INFO L93 Difference]: Finished difference Result 1370 states and 2028 transitions. [2019-09-08 04:32:35,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:32:35,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-09-08 04:32:35,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:35,119 INFO L225 Difference]: With dead ends: 1370 [2019-09-08 04:32:35,119 INFO L226 Difference]: Without dead ends: 796 [2019-09-08 04:32:35,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:35,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-09-08 04:32:35,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 795. [2019-09-08 04:32:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-09-08 04:32:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1180 transitions. [2019-09-08 04:32:35,167 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1180 transitions. Word has length 206 [2019-09-08 04:32:35,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:35,168 INFO L475 AbstractCegarLoop]: Abstraction has 795 states and 1180 transitions. [2019-09-08 04:32:35,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:32:35,168 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1180 transitions. [2019-09-08 04:32:35,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-08 04:32:35,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:35,175 INFO L399 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-09-08 04:32:35,175 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:35,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:35,175 INFO L82 PathProgramCache]: Analyzing trace with hash -786715774, now seen corresponding path program 1 times [2019-09-08 04:32:35,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:35,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:35,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:35,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:35,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:35,341 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:32:35,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:35,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:32:35,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:32:35,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:32:35,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:35,343 INFO L87 Difference]: Start difference. First operand 795 states and 1180 transitions. Second operand 3 states. [2019-09-08 04:32:35,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:35,396 INFO L93 Difference]: Finished difference Result 1826 states and 2800 transitions. [2019-09-08 04:32:35,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:32:35,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2019-09-08 04:32:35,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:35,406 INFO L225 Difference]: With dead ends: 1826 [2019-09-08 04:32:35,406 INFO L226 Difference]: Without dead ends: 1096 [2019-09-08 04:32:35,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:35,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2019-09-08 04:32:35,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1095. [2019-09-08 04:32:35,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2019-09-08 04:32:35,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1684 transitions. [2019-09-08 04:32:35,458 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1684 transitions. Word has length 207 [2019-09-08 04:32:35,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:35,460 INFO L475 AbstractCegarLoop]: Abstraction has 1095 states and 1684 transitions. [2019-09-08 04:32:35,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:32:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1684 transitions. [2019-09-08 04:32:35,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 04:32:35,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:35,469 INFO L399 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-09-08 04:32:35,469 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:35,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:35,469 INFO L82 PathProgramCache]: Analyzing trace with hash -709603746, now seen corresponding path program 1 times [2019-09-08 04:32:35,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:35,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:35,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:35,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:35,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:32:35,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:35,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:32:35,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:32:35,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:32:35,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:35,627 INFO L87 Difference]: Start difference. First operand 1095 states and 1684 transitions. Second operand 3 states. [2019-09-08 04:32:35,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:35,784 INFO L93 Difference]: Finished difference Result 2702 states and 4272 transitions. [2019-09-08 04:32:35,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:32:35,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-08 04:32:35,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:35,801 INFO L225 Difference]: With dead ends: 2702 [2019-09-08 04:32:35,801 INFO L226 Difference]: Without dead ends: 1672 [2019-09-08 04:32:35,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:32:35,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2019-09-08 04:32:35,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1671. [2019-09-08 04:32:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2019-09-08 04:32:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2644 transitions. [2019-09-08 04:32:35,920 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2644 transitions. Word has length 208 [2019-09-08 04:32:35,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:35,921 INFO L475 AbstractCegarLoop]: Abstraction has 1671 states and 2644 transitions. [2019-09-08 04:32:35,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:32:35,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2644 transitions. [2019-09-08 04:32:35,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 04:32:35,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:35,940 INFO L399 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-09-08 04:32:35,940 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:35,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:35,941 INFO L82 PathProgramCache]: Analyzing trace with hash 324914454, now seen corresponding path program 1 times [2019-09-08 04:32:35,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:35,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:35,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:35,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:35,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:36,471 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:32:36,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:36,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 04:32:36,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 04:32:36,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 04:32:36,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:32:36,476 INFO L87 Difference]: Start difference. First operand 1671 states and 2644 transitions. Second operand 19 states. [2019-09-08 04:32:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:41,584 INFO L93 Difference]: Finished difference Result 4050 states and 6402 transitions. [2019-09-08 04:32:41,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 04:32:41,584 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 210 [2019-09-08 04:32:41,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:41,616 INFO L225 Difference]: With dead ends: 4050 [2019-09-08 04:32:41,616 INFO L226 Difference]: Without dead ends: 3825 [2019-09-08 04:32:41,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 04:32:41,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3825 states. [2019-09-08 04:32:41,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3825 to 3788. [2019-09-08 04:32:41,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3788 states. [2019-09-08 04:32:41,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3788 states and 6041 transitions. [2019-09-08 04:32:41,865 INFO L78 Accepts]: Start accepts. Automaton has 3788 states and 6041 transitions. Word has length 210 [2019-09-08 04:32:41,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:41,865 INFO L475 AbstractCegarLoop]: Abstraction has 3788 states and 6041 transitions. [2019-09-08 04:32:41,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 04:32:41,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 6041 transitions. [2019-09-08 04:32:41,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-08 04:32:41,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:41,888 INFO L399 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-09-08 04:32:41,888 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:41,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:41,889 INFO L82 PathProgramCache]: Analyzing trace with hash 39326315, now seen corresponding path program 1 times [2019-09-08 04:32:41,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:41,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:41,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:41,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:41,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:42,233 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:32:42,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:42,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 04:32:42,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 04:32:42,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 04:32:42,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:32:42,236 INFO L87 Difference]: Start difference. First operand 3788 states and 6041 transitions. Second operand 15 states. [2019-09-08 04:32:46,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:46,056 INFO L93 Difference]: Finished difference Result 4841 states and 7516 transitions. [2019-09-08 04:32:46,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 04:32:46,057 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 211 [2019-09-08 04:32:46,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:46,086 INFO L225 Difference]: With dead ends: 4841 [2019-09-08 04:32:46,087 INFO L226 Difference]: Without dead ends: 3890 [2019-09-08 04:32:46,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 04:32:46,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2019-09-08 04:32:46,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 3858. [2019-09-08 04:32:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3858 states. [2019-09-08 04:32:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3858 states to 3858 states and 6154 transitions. [2019-09-08 04:32:46,309 INFO L78 Accepts]: Start accepts. Automaton has 3858 states and 6154 transitions. Word has length 211 [2019-09-08 04:32:46,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:46,309 INFO L475 AbstractCegarLoop]: Abstraction has 3858 states and 6154 transitions. [2019-09-08 04:32:46,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 04:32:46,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3858 states and 6154 transitions. [2019-09-08 04:32:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-08 04:32:46,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:46,332 INFO L399 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-09-08 04:32:46,332 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:46,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:46,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1251493429, now seen corresponding path program 1 times [2019-09-08 04:32:46,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:46,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:46,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:46,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:46,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 04:32:46,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:46,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 04:32:46,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 04:32:46,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 04:32:46,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:32:46,634 INFO L87 Difference]: Start difference. First operand 3858 states and 6154 transitions. Second operand 16 states. [2019-09-08 04:32:47,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:47,106 INFO L93 Difference]: Finished difference Result 5057 states and 7877 transitions. [2019-09-08 04:32:47,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 04:32:47,106 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 211 [2019-09-08 04:32:47,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:47,134 INFO L225 Difference]: With dead ends: 5057 [2019-09-08 04:32:47,134 INFO L226 Difference]: Without dead ends: 4028 [2019-09-08 04:32:47,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-09-08 04:32:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4028 states. [2019-09-08 04:32:47,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4028 to 4028. [2019-09-08 04:32:47,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4028 states. [2019-09-08 04:32:47,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4028 states to 4028 states and 6404 transitions. [2019-09-08 04:32:47,473 INFO L78 Accepts]: Start accepts. Automaton has 4028 states and 6404 transitions. Word has length 211 [2019-09-08 04:32:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:47,473 INFO L475 AbstractCegarLoop]: Abstraction has 4028 states and 6404 transitions. [2019-09-08 04:32:47,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 04:32:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 4028 states and 6404 transitions. [2019-09-08 04:32:47,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-08 04:32:47,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:47,495 INFO L399 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-09-08 04:32:47,495 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:47,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:47,496 INFO L82 PathProgramCache]: Analyzing trace with hash -671262686, now seen corresponding path program 1 times [2019-09-08 04:32:47,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:47,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:47,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:47,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:47,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:32:47,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:47,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:32:47,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:32:47,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:32:47,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:32:47,704 INFO L87 Difference]: Start difference. First operand 4028 states and 6404 transitions. Second operand 5 states. [2019-09-08 04:32:48,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:48,762 INFO L93 Difference]: Finished difference Result 7749 states and 12158 transitions. [2019-09-08 04:32:48,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:32:48,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 211 [2019-09-08 04:32:48,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:48,823 INFO L225 Difference]: With dead ends: 7749 [2019-09-08 04:32:48,823 INFO L226 Difference]: Without dead ends: 7174 [2019-09-08 04:32:48,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:32:48,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7174 states. [2019-09-08 04:32:49,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7174 to 7156. [2019-09-08 04:32:49,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7156 states. [2019-09-08 04:32:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7156 states to 7156 states and 11339 transitions. [2019-09-08 04:32:49,295 INFO L78 Accepts]: Start accepts. Automaton has 7156 states and 11339 transitions. Word has length 211 [2019-09-08 04:32:49,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:49,298 INFO L475 AbstractCegarLoop]: Abstraction has 7156 states and 11339 transitions. [2019-09-08 04:32:49,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:32:49,298 INFO L276 IsEmpty]: Start isEmpty. Operand 7156 states and 11339 transitions. [2019-09-08 04:32:49,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-08 04:32:49,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:49,332 INFO L399 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-09-08 04:32:49,332 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:49,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:49,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1154938013, now seen corresponding path program 1 times [2019-09-08 04:32:49,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:49,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:49,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:49,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:49,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:49,554 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:32:49,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:49,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:32:49,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:32:49,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:32:49,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:32:49,556 INFO L87 Difference]: Start difference. First operand 7156 states and 11339 transitions. Second operand 7 states. [2019-09-08 04:32:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:51,459 INFO L93 Difference]: Finished difference Result 15881 states and 25146 transitions. [2019-09-08 04:32:51,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:32:51,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 211 [2019-09-08 04:32:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:51,537 INFO L225 Difference]: With dead ends: 15881 [2019-09-08 04:32:51,537 INFO L226 Difference]: Without dead ends: 13026 [2019-09-08 04:32:51,558 INFO L628 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-09-08 04:32:51,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13026 states. [2019-09-08 04:32:52,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13026 to 13020. [2019-09-08 04:32:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13020 states. [2019-09-08 04:32:52,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 20697 transitions. [2019-09-08 04:32:52,795 INFO L78 Accepts]: Start accepts. Automaton has 13020 states and 20697 transitions. Word has length 211 [2019-09-08 04:32:52,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:52,795 INFO L475 AbstractCegarLoop]: Abstraction has 13020 states and 20697 transitions. [2019-09-08 04:32:52,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:32:52,796 INFO L276 IsEmpty]: Start isEmpty. Operand 13020 states and 20697 transitions. [2019-09-08 04:32:52,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 04:32:52,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:52,830 INFO L399 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-09-08 04:32:52,831 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:52,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:52,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1728661351, now seen corresponding path program 1 times [2019-09-08 04:32:52,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:52,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:52,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:52,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:52,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:32:53,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:53,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 04:32:53,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 04:32:53,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 04:32:53,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-09-08 04:32:53,325 INFO L87 Difference]: Start difference. First operand 13020 states and 20697 transitions. Second operand 26 states. [2019-09-08 04:32:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:54,500 INFO L93 Difference]: Finished difference Result 22920 states and 36507 transitions. [2019-09-08 04:32:54,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 04:32:54,500 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 212 [2019-09-08 04:32:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:54,570 INFO L225 Difference]: With dead ends: 22920 [2019-09-08 04:32:54,570 INFO L226 Difference]: Without dead ends: 14201 [2019-09-08 04:32:54,610 INFO L628 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-09-08 04:32:54,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14201 states. [2019-09-08 04:32:55,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14201 to 14180. [2019-09-08 04:32:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14180 states. [2019-09-08 04:32:55,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14180 states to 14180 states and 22394 transitions. [2019-09-08 04:32:55,396 INFO L78 Accepts]: Start accepts. Automaton has 14180 states and 22394 transitions. Word has length 212 [2019-09-08 04:32:55,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:55,397 INFO L475 AbstractCegarLoop]: Abstraction has 14180 states and 22394 transitions. [2019-09-08 04:32:55,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 04:32:55,398 INFO L276 IsEmpty]: Start isEmpty. Operand 14180 states and 22394 transitions. [2019-09-08 04:32:55,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 04:32:55,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:55,431 INFO L399 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-09-08 04:32:55,431 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:55,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:55,431 INFO L82 PathProgramCache]: Analyzing trace with hash -925986545, now seen corresponding path program 1 times [2019-09-08 04:32:55,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:55,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:55,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:55,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:55,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:55,641 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:32:55,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:55,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:32:55,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:32:55,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:32:55,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:32:55,643 INFO L87 Difference]: Start difference. First operand 14180 states and 22394 transitions. Second operand 10 states. [2019-09-08 04:32:56,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:56,165 INFO L93 Difference]: Finished difference Result 14303 states and 22546 transitions. [2019-09-08 04:32:56,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:32:56,165 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 216 [2019-09-08 04:32:56,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:56,230 INFO L225 Difference]: With dead ends: 14303 [2019-09-08 04:32:56,231 INFO L226 Difference]: Without dead ends: 14300 [2019-09-08 04:32:56,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:32:56,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14300 states. [2019-09-08 04:32:56,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14300 to 14300. [2019-09-08 04:32:56,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14300 states. [2019-09-08 04:32:56,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14300 states to 14300 states and 22504 transitions. [2019-09-08 04:32:56,915 INFO L78 Accepts]: Start accepts. Automaton has 14300 states and 22504 transitions. Word has length 216 [2019-09-08 04:32:56,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:56,916 INFO L475 AbstractCegarLoop]: Abstraction has 14300 states and 22504 transitions. [2019-09-08 04:32:56,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:32:56,917 INFO L276 IsEmpty]: Start isEmpty. Operand 14300 states and 22504 transitions. [2019-09-08 04:32:56,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 04:32:56,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:56,947 INFO L399 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-09-08 04:32:56,947 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:56,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:56,948 INFO L82 PathProgramCache]: Analyzing trace with hash -17024576, now seen corresponding path program 1 times [2019-09-08 04:32:56,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:56,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:56,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:56,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:56,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:57,158 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:32:57,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:57,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:32:57,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:32:57,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:32:57,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:32:57,161 INFO L87 Difference]: Start difference. First operand 14300 states and 22504 transitions. Second operand 5 states. [2019-09-08 04:32:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:57,723 INFO L93 Difference]: Finished difference Result 24362 states and 38491 transitions. [2019-09-08 04:32:57,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:32:57,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 221 [2019-09-08 04:32:57,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:57,796 INFO L225 Difference]: With dead ends: 24362 [2019-09-08 04:32:57,796 INFO L226 Difference]: Without dead ends: 14741 [2019-09-08 04:32:57,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:32:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14741 states. [2019-09-08 04:32:58,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14741 to 14510. [2019-09-08 04:32:58,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14510 states. [2019-09-08 04:32:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14510 states to 14510 states and 22750 transitions. [2019-09-08 04:32:58,539 INFO L78 Accepts]: Start accepts. Automaton has 14510 states and 22750 transitions. Word has length 221 [2019-09-08 04:32:58,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:58,540 INFO L475 AbstractCegarLoop]: Abstraction has 14510 states and 22750 transitions. [2019-09-08 04:32:58,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:32:58,540 INFO L276 IsEmpty]: Start isEmpty. Operand 14510 states and 22750 transitions. [2019-09-08 04:32:58,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 04:32:58,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:58,561 INFO L399 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-09-08 04:32:58,561 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:58,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:58,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2066975880, now seen corresponding path program 1 times [2019-09-08 04:32:58,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:58,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:58,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:58,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:58,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:58,772 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:32:58,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:58,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:32:58,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:32:58,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:32:58,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:32:58,776 INFO L87 Difference]: Start difference. First operand 14510 states and 22750 transitions. Second operand 11 states. [2019-09-08 04:32:59,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:59,433 INFO L93 Difference]: Finished difference Result 24407 states and 37619 transitions. [2019-09-08 04:32:59,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:32:59,434 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 221 [2019-09-08 04:32:59,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:59,508 INFO L225 Difference]: With dead ends: 24407 [2019-09-08 04:32:59,508 INFO L226 Difference]: Without dead ends: 14576 [2019-09-08 04:32:59,541 INFO L628 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-09-08 04:32:59,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14576 states. [2019-09-08 04:33:00,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14576 to 14558. [2019-09-08 04:33:00,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14558 states. [2019-09-08 04:33:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14558 states to 14558 states and 22770 transitions. [2019-09-08 04:33:00,446 INFO L78 Accepts]: Start accepts. Automaton has 14558 states and 22770 transitions. Word has length 221 [2019-09-08 04:33:00,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:33:00,447 INFO L475 AbstractCegarLoop]: Abstraction has 14558 states and 22770 transitions. [2019-09-08 04:33:00,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:33:00,447 INFO L276 IsEmpty]: Start isEmpty. Operand 14558 states and 22770 transitions. [2019-09-08 04:33:00,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-08 04:33:00,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:33:00,466 INFO L399 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-09-08 04:33:00,467 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:33:00,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:33:00,467 INFO L82 PathProgramCache]: Analyzing trace with hash -627713257, now seen corresponding path program 1 times [2019-09-08 04:33:00,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:33:00,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:33:00,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:00,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:33:00,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:33:00,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:33:00,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:33:00,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:33:00,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:33:00,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:33:00,638 INFO L87 Difference]: Start difference. First operand 14558 states and 22770 transitions. Second operand 6 states. [2019-09-08 04:33:01,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:33:01,757 INFO L93 Difference]: Finished difference Result 39589 states and 63143 transitions. [2019-09-08 04:33:01,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:33:01,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 222 [2019-09-08 04:33:01,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:33:01,858 INFO L225 Difference]: With dead ends: 39589 [2019-09-08 04:33:01,858 INFO L226 Difference]: Without dead ends: 29434 [2019-09-08 04:33:01,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:33:01,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29434 states. [2019-09-08 04:33:02,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29434 to 28979. [2019-09-08 04:33:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28979 states. [2019-09-08 04:33:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28979 states to 28979 states and 46021 transitions. [2019-09-08 04:33:02,964 INFO L78 Accepts]: Start accepts. Automaton has 28979 states and 46021 transitions. Word has length 222 [2019-09-08 04:33:02,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:33:02,965 INFO L475 AbstractCegarLoop]: Abstraction has 28979 states and 46021 transitions. [2019-09-08 04:33:02,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:33:02,965 INFO L276 IsEmpty]: Start isEmpty. Operand 28979 states and 46021 transitions. [2019-09-08 04:33:03,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-08 04:33:03,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:33:03,005 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:33:03,006 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:33:03,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:33:03,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1514697324, now seen corresponding path program 1 times [2019-09-08 04:33:03,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:33:03,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:33:03,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:03,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:33:03,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:03,192 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 04:33:03,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:33:03,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:33:03,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:33:03,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:33:03,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:33:03,194 INFO L87 Difference]: Start difference. First operand 28979 states and 46021 transitions. Second operand 8 states. [2019-09-08 04:33:10,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:33:10,033 INFO L93 Difference]: Finished difference Result 87551 states and 147265 transitions. [2019-09-08 04:33:10,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:33:10,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 258 [2019-09-08 04:33:10,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:33:10,349 INFO L225 Difference]: With dead ends: 87551 [2019-09-08 04:33:10,350 INFO L226 Difference]: Without dead ends: 58637 [2019-09-08 04:33:10,460 INFO L628 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-09-08 04:33:10,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58637 states. [2019-09-08 04:33:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58637 to 37811. [2019-09-08 04:33:12,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37811 states. [2019-09-08 04:33:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37811 states to 37811 states and 66067 transitions. [2019-09-08 04:33:12,642 INFO L78 Accepts]: Start accepts. Automaton has 37811 states and 66067 transitions. Word has length 258 [2019-09-08 04:33:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:33:12,642 INFO L475 AbstractCegarLoop]: Abstraction has 37811 states and 66067 transitions. [2019-09-08 04:33:12,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:33:12,643 INFO L276 IsEmpty]: Start isEmpty. Operand 37811 states and 66067 transitions. [2019-09-08 04:33:12,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 04:33:12,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:33:12,732 INFO L399 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-09-08 04:33:12,732 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:33:12,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:33:12,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1665358554, now seen corresponding path program 1 times [2019-09-08 04:33:12,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:33:12,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:33:12,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:12,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:33:12,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:12,910 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:33:12,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:33:12,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:33:12,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:33:12,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:33:12,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:33:12,913 INFO L87 Difference]: Start difference. First operand 37811 states and 66067 transitions. Second operand 8 states. [2019-09-08 04:33:19,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:33:19,823 INFO L93 Difference]: Finished difference Result 114851 states and 216919 transitions. [2019-09-08 04:33:19,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:33:19,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 244 [2019-09-08 04:33:19,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:33:20,579 INFO L225 Difference]: With dead ends: 114851 [2019-09-08 04:33:20,579 INFO L226 Difference]: Without dead ends: 77105 [2019-09-08 04:33:20,722 INFO L628 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-09-08 04:33:20,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77105 states. [2019-09-08 04:33:25,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77105 to 55655. [2019-09-08 04:33:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55655 states. [2019-09-08 04:33:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55655 states to 55655 states and 110491 transitions. [2019-09-08 04:33:25,374 INFO L78 Accepts]: Start accepts. Automaton has 55655 states and 110491 transitions. Word has length 244 [2019-09-08 04:33:25,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:33:25,375 INFO L475 AbstractCegarLoop]: Abstraction has 55655 states and 110491 transitions. [2019-09-08 04:33:25,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:33:25,375 INFO L276 IsEmpty]: Start isEmpty. Operand 55655 states and 110491 transitions. [2019-09-08 04:33:25,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 04:33:25,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:33:25,561 INFO L399 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-09-08 04:33:25,561 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:33:25,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:33:25,561 INFO L82 PathProgramCache]: Analyzing trace with hash 946642852, now seen corresponding path program 1 times [2019-09-08 04:33:25,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:33:25,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:33:25,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:25,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:33:25,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:25,745 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:33:25,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:33:25,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:33:25,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:33:25,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:33:25,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:33:25,747 INFO L87 Difference]: Start difference. First operand 55655 states and 110491 transitions. Second operand 8 states. [2019-09-08 04:33:36,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:33:36,113 INFO L93 Difference]: Finished difference Result 169859 states and 369157 transitions. [2019-09-08 04:33:36,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:33:36,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 245 [2019-09-08 04:33:36,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:33:36,684 INFO L225 Difference]: With dead ends: 169859 [2019-09-08 04:33:36,684 INFO L226 Difference]: Without dead ends: 114269 [2019-09-08 04:33:36,929 INFO L628 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-09-08 04:33:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114269 states. [2019-09-08 04:33:42,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114269 to 91535. [2019-09-08 04:33:42,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91535 states. [2019-09-08 04:33:42,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91535 states to 91535 states and 207793 transitions. [2019-09-08 04:33:42,568 INFO L78 Accepts]: Start accepts. Automaton has 91535 states and 207793 transitions. Word has length 245 [2019-09-08 04:33:42,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:33:42,569 INFO L475 AbstractCegarLoop]: Abstraction has 91535 states and 207793 transitions. [2019-09-08 04:33:42,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:33:42,569 INFO L276 IsEmpty]: Start isEmpty. Operand 91535 states and 207793 transitions. [2019-09-08 04:33:43,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 04:33:43,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:33:43,036 INFO L399 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-09-08 04:33:43,037 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:33:43,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:33:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1829537673, now seen corresponding path program 1 times [2019-09-08 04:33:43,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:33:43,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:33:43,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:43,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:33:43,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 04:33:43,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:33:43,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:33:43,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:33:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:43,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 2959 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:33:43,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:33:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-08 04:33:43,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:33:43,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2019-09-08 04:33:43,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:33:43,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:33:43,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:33:43,990 INFO L87 Difference]: Start difference. First operand 91535 states and 207793 transitions. Second operand 13 states. [2019-09-08 04:33:52,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:33:52,853 INFO L93 Difference]: Finished difference Result 188932 states and 425661 transitions. [2019-09-08 04:33:52,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 04:33:52,854 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 241 [2019-09-08 04:33:52,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:33:53,641 INFO L225 Difference]: With dead ends: 188932 [2019-09-08 04:33:53,642 INFO L226 Difference]: Without dead ends: 97331 [2019-09-08 04:33:54,081 INFO L628 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-09-08 04:33:54,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97331 states. [2019-09-08 04:34:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97331 to 96978. [2019-09-08 04:34:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96978 states. [2019-09-08 04:34:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96978 states to 96978 states and 215462 transitions. [2019-09-08 04:34:03,677 INFO L78 Accepts]: Start accepts. Automaton has 96978 states and 215462 transitions. Word has length 241 [2019-09-08 04:34:03,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:34:03,678 INFO L475 AbstractCegarLoop]: Abstraction has 96978 states and 215462 transitions. [2019-09-08 04:34:03,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:34:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 96978 states and 215462 transitions. [2019-09-08 04:34:04,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-08 04:34:04,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:34:04,637 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:34:04,637 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:34:04,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:34:04,637 INFO L82 PathProgramCache]: Analyzing trace with hash -193096347, now seen corresponding path program 1 times [2019-09-08 04:34:04,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:34:04,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:34:04,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:04,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:04,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:04,923 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 04:34:04,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:34:04,924 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:34:04,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:05,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 3114 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 04:34:05,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:34:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 04:34:05,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:34:05,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-09-08 04:34:05,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 04:34:05,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 04:34:05,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:34:05,877 INFO L87 Difference]: Start difference. First operand 96978 states and 215462 transitions. Second operand 16 states. [2019-09-08 04:34:15,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:34:15,579 INFO L93 Difference]: Finished difference Result 214481 states and 467410 transitions. [2019-09-08 04:34:15,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 04:34:15,586 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 257 [2019-09-08 04:34:15,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:34:16,229 INFO L225 Difference]: With dead ends: 214481 [2019-09-08 04:34:16,229 INFO L226 Difference]: Without dead ends: 117338 [2019-09-08 04:34:17,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2019-09-08 04:34:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117338 states. [2019-09-08 04:34:26,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117338 to 115555. [2019-09-08 04:34:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115555 states. [2019-09-08 04:34:26,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115555 states to 115555 states and 244744 transitions. [2019-09-08 04:34:26,932 INFO L78 Accepts]: Start accepts. Automaton has 115555 states and 244744 transitions. Word has length 257 [2019-09-08 04:34:26,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:34:26,932 INFO L475 AbstractCegarLoop]: Abstraction has 115555 states and 244744 transitions. [2019-09-08 04:34:26,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 04:34:26,932 INFO L276 IsEmpty]: Start isEmpty. Operand 115555 states and 244744 transitions. [2019-09-08 04:34:27,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-08 04:34:27,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:34:27,299 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:34:27,299 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:34:27,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:34:27,300 INFO L82 PathProgramCache]: Analyzing trace with hash -2092664010, now seen corresponding path program 1 times [2019-09-08 04:34:27,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:34:27,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:34:27,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:27,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:27,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:27,491 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 04:34:27,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:34:27,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:34:27,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:34:27,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:34:27,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:34:27,494 INFO L87 Difference]: Start difference. First operand 115555 states and 244744 transitions. Second operand 6 states. [2019-09-08 04:34:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:34:40,746 INFO L93 Difference]: Finished difference Result 276372 states and 566767 transitions. [2019-09-08 04:34:40,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:34:40,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 269 [2019-09-08 04:34:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:34:42,205 INFO L225 Difference]: With dead ends: 276372 [2019-09-08 04:34:42,206 INFO L226 Difference]: Without dead ends: 232751 [2019-09-08 04:34:42,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:34:42,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232751 states. [2019-09-08 04:34:53,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232751 to 232308. [2019-09-08 04:34:53,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232308 states. [2019-09-08 04:35:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232308 states to 232308 states and 491816 transitions. [2019-09-08 04:35:04,053 INFO L78 Accepts]: Start accepts. Automaton has 232308 states and 491816 transitions. Word has length 269 [2019-09-08 04:35:04,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:35:04,054 INFO L475 AbstractCegarLoop]: Abstraction has 232308 states and 491816 transitions. [2019-09-08 04:35:04,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:35:04,054 INFO L276 IsEmpty]: Start isEmpty. Operand 232308 states and 491816 transitions. [2019-09-08 04:35:04,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-08 04:35:04,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:35:04,886 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:35:04,886 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:35:04,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:35:04,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1347963576, now seen corresponding path program 1 times [2019-09-08 04:35:04,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:35:04,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:35:04,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:04,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:35:04,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:35:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:35:05,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:35:05,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 04:35:05,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 04:35:05,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 04:35:05,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:35:05,295 INFO L87 Difference]: Start difference. First operand 232308 states and 491816 transitions. Second operand 19 states. [2019-09-08 04:35:28,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:35:28,762 INFO L93 Difference]: Finished difference Result 390267 states and 785801 transitions. [2019-09-08 04:35:28,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 04:35:28,763 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 270 [2019-09-08 04:35:28,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:35:30,420 INFO L225 Difference]: With dead ends: 390267 [2019-09-08 04:35:30,420 INFO L226 Difference]: Without dead ends: 354968 [2019-09-08 04:35:30,622 INFO L628 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-09-08 04:35:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354968 states. [2019-09-08 04:36:06,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354968 to 352896. [2019-09-08 04:36:06,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352896 states. [2019-09-08 04:36:08,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352896 states to 352896 states and 722020 transitions. [2019-09-08 04:36:08,208 INFO L78 Accepts]: Start accepts. Automaton has 352896 states and 722020 transitions. Word has length 270 [2019-09-08 04:36:08,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:36:08,208 INFO L475 AbstractCegarLoop]: Abstraction has 352896 states and 722020 transitions. [2019-09-08 04:36:08,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 04:36:08,209 INFO L276 IsEmpty]: Start isEmpty. Operand 352896 states and 722020 transitions. [2019-09-08 04:36:09,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-08 04:36:09,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:36:09,368 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:36:09,368 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:36:09,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:36:09,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1826944727, now seen corresponding path program 1 times [2019-09-08 04:36:09,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:36:09,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:36:09,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:36:09,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:36:09,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:36:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:36:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 04:36:09,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:36:09,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:36:09,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:36:09,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:36:09,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:36:09,560 INFO L87 Difference]: Start difference. First operand 352896 states and 722020 transitions. Second operand 7 states. [2019-09-08 04:36:58,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:36:58,311 INFO L93 Difference]: Finished difference Result 783248 states and 1804275 transitions. [2019-09-08 04:36:58,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:36:58,312 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 269 [2019-09-08 04:36:58,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:37:02,462 INFO L225 Difference]: With dead ends: 783248 [2019-09-08 04:37:02,462 INFO L226 Difference]: Without dead ends: 700737 [2019-09-08 04:37:02,881 INFO L628 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-09-08 04:37:03,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700737 states. [2019-09-08 04:38:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700737 to 678926. [2019-09-08 04:38:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678926 states. [2019-09-08 04:38:36,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678926 states to 678926 states and 1631319 transitions. [2019-09-08 04:38:36,123 INFO L78 Accepts]: Start accepts. Automaton has 678926 states and 1631319 transitions. Word has length 269 [2019-09-08 04:38:36,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:38:36,124 INFO L475 AbstractCegarLoop]: Abstraction has 678926 states and 1631319 transitions. [2019-09-08 04:38:36,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:38:36,124 INFO L276 IsEmpty]: Start isEmpty. Operand 678926 states and 1631319 transitions.