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_spec1_product16.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:38:49,612 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:38:49,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:38:49,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:38:49,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:38:49,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:38:49,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:38:49,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:38:49,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:38:49,650 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:38:49,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:38:49,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:38:49,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:38:49,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:38:49,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:38:49,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:38:49,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:38:49,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:38:49,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:38:49,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:38:49,675 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:38:49,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:38:49,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:38:49,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:38:49,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:38:49,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:38:49,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:38:49,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:38:49,690 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:38:49,691 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:38:49,691 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:38:49,693 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:38:49,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:38:49,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:38:49,699 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:38:49,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:38:49,700 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:38:49,700 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:38:49,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:38:49,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:38:49,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:38:49,704 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:38:49,728 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:38:49,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:38:49,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:38:49,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:38:49,731 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:38:49,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:38:49,732 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:38:49,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:38:49,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:38:49,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:38:49,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:38:49,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:38:49,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:38:49,735 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:38:49,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:38:49,735 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:38:49,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:38:49,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:38:49,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:38:49,736 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:38:49,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:38:49,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:38:49,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:38:49,737 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:38:49,737 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:38:49,738 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:38:49,738 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:38:49,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:38:49,738 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:38:49,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:38:49,809 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:38:49,813 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:38:49,816 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:38:49,817 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:38:49,818 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec1_product16.cil.c [2019-09-08 04:38:49,867 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffa72a7d7/d582e612ddd5428ca9646d34cfb6659d/FLAGbe2548b7e [2019-09-08 04:38:50,510 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:38:50,511 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product16.cil.c [2019-09-08 04:38:50,545 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffa72a7d7/d582e612ddd5428ca9646d34cfb6659d/FLAGbe2548b7e [2019-09-08 04:38:50,744 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffa72a7d7/d582e612ddd5428ca9646d34cfb6659d [2019-09-08 04:38:50,755 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:38:50,757 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:38:50,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:38:50,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:38:50,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:38:50,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:38:50" (1/1) ... [2019-09-08 04:38:50,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1497061b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:38:50, skipping insertion in model container [2019-09-08 04:38:50,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:38:50" (1/1) ... [2019-09-08 04:38:50,776 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:38:50,870 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:38:51,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:38:51,753 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:38:51,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:38:51,959 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:38:51,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:38:51 WrapperNode [2019-09-08 04:38:51,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:38:51,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:38:51,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:38:51,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:38:51,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:38:51" (1/1) ... [2019-09-08 04:38:51,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:38:51" (1/1) ... [2019-09-08 04:38:52,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:38:51" (1/1) ... [2019-09-08 04:38:52,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:38:51" (1/1) ... [2019-09-08 04:38:52,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:38:51" (1/1) ... [2019-09-08 04:38:52,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:38:51" (1/1) ... [2019-09-08 04:38:52,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:38:51" (1/1) ... [2019-09-08 04:38:52,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:38:52,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:38:52,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:38:52,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:38:52,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:38:51" (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:38:52,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:38:52,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:38:52,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:38:52,254 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 04:38:52,255 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 04:38:52,256 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 04:38:52,256 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 04:38:52,256 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 04:38:52,257 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 04:38:52,257 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 04:38:52,257 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 04:38:52,258 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 04:38:52,258 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 04:38:52,259 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 04:38:52,260 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 04:38:52,260 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 04:38:52,263 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 04:38:52,263 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 04:38:52,263 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 04:38:52,264 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 04:38:52,264 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 04:38:52,264 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 04:38:52,264 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 04:38:52,264 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 04:38:52,265 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 04:38:52,265 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:38:52,265 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:38:52,265 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:38:52,265 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:38:52,265 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 04:38:52,266 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 04:38:52,266 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 04:38:52,266 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 04:38:52,266 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 04:38:52,266 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 04:38:52,266 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 04:38:52,267 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 04:38:52,267 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 04:38:52,267 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 04:38:52,267 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 04:38:52,267 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 04:38:52,267 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 04:38:52,268 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 04:38:52,268 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 04:38:52,268 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 04:38:52,268 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 04:38:52,268 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 04:38:52,268 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 04:38:52,269 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 04:38:52,269 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 04:38:52,269 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 04:38:52,269 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 04:38:52,269 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 04:38:52,269 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 04:38:52,269 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 04:38:52,270 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 04:38:52,270 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 04:38:52,270 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 04:38:52,270 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:38:52,271 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:38:52,271 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:38:52,271 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:38:52,271 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:38:52,271 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:38:52,271 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:38:52,271 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:38:52,272 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-09-08 04:38:52,272 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 04:38:52,272 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 04:38:52,272 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 04:38:52,272 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 04:38:52,273 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 04:38:52,273 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 04:38:52,273 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 04:38:52,274 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 04:38:52,274 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:38:52,274 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:38:52,274 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 04:38:52,274 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 04:38:52,275 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 04:38:52,275 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 04:38:52,275 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 04:38:52,275 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 04:38:52,276 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 04:38:52,276 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 04:38:52,276 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 04:38:52,276 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 04:38:52,277 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 04:38:52,277 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 04:38:52,277 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 04:38:52,278 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 04:38:52,278 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 04:38:52,278 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 04:38:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 04:38:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 04:38:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 04:38:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 04:38:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 04:38:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-08 04:38:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 04:38:52,280 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 04:38:52,280 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 04:38:52,280 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 04:38:52,280 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 04:38:52,280 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 04:38:52,280 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 04:38:52,280 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 04:38:52,281 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 04:38:52,281 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 04:38:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:38:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:38:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:38:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 04:38:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:38:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 04:38:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 04:38:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 04:38:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 04:38:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 04:38:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 04:38:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 04:38:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 04:38:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 04:38:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 04:38:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 04:38:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 04:38:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 04:38:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 04:38:52,286 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 04:38:52,286 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 04:38:52,286 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 04:38:52,286 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 04:38:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 04:38:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 04:38:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 04:38:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:38:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:38:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:38:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:38:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 04:38:52,291 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 04:38:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 04:38:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 04:38:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 04:38:52,300 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 04:38:52,300 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 04:38:52,301 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 04:38:52,301 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 04:38:52,301 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 04:38:52,301 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 04:38:52,302 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 04:38:52,302 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 04:38:52,303 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 04:38:52,303 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 04:38:52,303 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 04:38:52,303 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 04:38:52,303 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 04:38:52,303 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 04:38:52,303 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 04:38:52,304 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 04:38:52,304 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 04:38:52,304 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 04:38:52,304 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 04:38:52,304 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 04:38:52,304 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 04:38:52,304 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 04:38:52,304 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 04:38:52,305 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 04:38:52,305 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:38:52,305 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:38:52,305 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:38:52,305 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:38:52,305 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:38:52,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:38:52,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:38:52,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:38:52,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:38:52,306 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:38:52,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:38:52,306 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:38:52,306 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:38:52,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:38:52,306 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:38:52,307 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:38:52,307 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:38:52,307 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 04:38:52,307 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 04:38:52,307 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 04:38:52,307 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 04:38:52,307 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 04:38:52,308 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 04:38:52,308 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 04:38:52,308 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 04:38:52,308 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 04:38:52,308 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:38:52,308 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 04:38:52,308 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-09-08 04:38:52,308 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 04:38:52,309 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 04:38:52,309 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 04:38:52,309 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 04:38:52,309 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 04:38:52,309 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 04:38:52,309 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 04:38:52,309 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 04:38:52,309 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 04:38:52,310 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 04:38:52,310 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:38:52,310 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:38:52,310 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 04:38:52,310 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 04:38:52,310 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 04:38:52,310 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 04:38:52,310 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 04:38:52,311 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 04:38:52,311 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 04:38:52,311 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 04:38:52,311 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 04:38:52,311 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 04:38:52,311 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 04:38:52,311 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 04:38:52,312 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 04:38:52,312 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 04:38:52,312 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 04:38:52,312 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 04:38:52,312 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 04:38:52,312 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 04:38:52,312 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 04:38:52,313 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 04:38:52,313 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-08 04:38:52,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:38:52,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:38:52,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:38:54,307 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:38:54,308 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 04:38:54,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:38:54 BoogieIcfgContainer [2019-09-08 04:38:54,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:38:54,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:38:54,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:38:54,314 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:38:54,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:38:50" (1/3) ... [2019-09-08 04:38:54,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4857bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:38:54, skipping insertion in model container [2019-09-08 04:38:54,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:38:51" (2/3) ... [2019-09-08 04:38:54,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4857bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:38:54, skipping insertion in model container [2019-09-08 04:38:54,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:38:54" (3/3) ... [2019-09-08 04:38:54,318 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec1_product16.cil.c [2019-09-08 04:38:54,328 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:38:54,339 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:38:54,356 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:38:54,398 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:38:54,399 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:38:54,399 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:38:54,399 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:38:54,399 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:38:54,399 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:38:54,399 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:38:54,399 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:38:54,400 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:38:54,436 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states. [2019-09-08 04:38:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 04:38:54,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:38:54,469 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 04:38:54,472 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:38:54,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:38:54,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1028752379, now seen corresponding path program 1 times [2019-09-08 04:38:54,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:38:54,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:38:54,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:38:54,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:38:54,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:38:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:38:55,077 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:38:55,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:38:55,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 04:38:55,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 04:38:55,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 04:38:55,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:38:55,104 INFO L87 Difference]: Start difference. First operand 476 states. Second operand 2 states. [2019-09-08 04:38:55,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:38:55,183 INFO L93 Difference]: Finished difference Result 694 states and 913 transitions. [2019-09-08 04:38:55,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 04:38:55,185 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 145 [2019-09-08 04:38:55,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:38:55,221 INFO L225 Difference]: With dead ends: 694 [2019-09-08 04:38:55,221 INFO L226 Difference]: Without dead ends: 453 [2019-09-08 04:38:55,229 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:38:55,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-08 04:38:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2019-09-08 04:38:55,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2019-09-08 04:38:55,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 601 transitions. [2019-09-08 04:38:55,364 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 601 transitions. Word has length 145 [2019-09-08 04:38:55,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:38:55,366 INFO L475 AbstractCegarLoop]: Abstraction has 453 states and 601 transitions. [2019-09-08 04:38:55,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 04:38:55,367 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 601 transitions. [2019-09-08 04:38:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 04:38:55,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:38:55,378 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 04:38:55,379 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:38:55,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:38:55,380 INFO L82 PathProgramCache]: Analyzing trace with hash -711556920, now seen corresponding path program 1 times [2019-09-08 04:38:55,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:38:55,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:38:55,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:38:55,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:38:55,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:38:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:38:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:38:55,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:38:55,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:38:55,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:38:55,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:38:55,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:38:55,664 INFO L87 Difference]: Start difference. First operand 453 states and 601 transitions. Second operand 3 states. [2019-09-08 04:38:55,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:38:55,708 INFO L93 Difference]: Finished difference Result 677 states and 882 transitions. [2019-09-08 04:38:55,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:38:55,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-08 04:38:55,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:38:55,714 INFO L225 Difference]: With dead ends: 677 [2019-09-08 04:38:55,714 INFO L226 Difference]: Without dead ends: 456 [2019-09-08 04:38:55,717 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:38:55,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-09-08 04:38:55,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 455. [2019-09-08 04:38:55,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-09-08 04:38:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 603 transitions. [2019-09-08 04:38:55,740 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 603 transitions. Word has length 146 [2019-09-08 04:38:55,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:38:55,741 INFO L475 AbstractCegarLoop]: Abstraction has 455 states and 603 transitions. [2019-09-08 04:38:55,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:38:55,741 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 603 transitions. [2019-09-08 04:38:55,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 04:38:55,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:38:55,745 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 04:38:55,745 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:38:55,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:38:55,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1834454924, now seen corresponding path program 1 times [2019-09-08 04:38:55,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:38:55,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:38:55,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:38:55,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:38:55,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:38:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:38:55,918 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:38:55,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:38:55,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:38:55,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:38:55,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:38:55,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:38:55,923 INFO L87 Difference]: Start difference. First operand 455 states and 603 transitions. Second operand 3 states. [2019-09-08 04:38:55,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:38:55,962 INFO L93 Difference]: Finished difference Result 886 states and 1204 transitions. [2019-09-08 04:38:55,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:38:55,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-08 04:38:55,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:38:55,967 INFO L225 Difference]: With dead ends: 886 [2019-09-08 04:38:55,967 INFO L226 Difference]: Without dead ends: 496 [2019-09-08 04:38:55,969 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:38:55,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-09-08 04:38:55,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 495. [2019-09-08 04:38:55,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 04:38:55,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 672 transitions. [2019-09-08 04:38:55,993 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 672 transitions. Word has length 152 [2019-09-08 04:38:55,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:38:55,993 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 672 transitions. [2019-09-08 04:38:55,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:38:55,994 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 672 transitions. [2019-09-08 04:38:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 04:38:55,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:38:55,997 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 04:38:55,997 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:38:55,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:38:55,998 INFO L82 PathProgramCache]: Analyzing trace with hash 316559845, now seen corresponding path program 1 times [2019-09-08 04:38:55,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:38:55,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:38:55,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:38:55,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:38:55,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:38:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:38:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:38:56,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:38:56,227 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) [2019-09-08 04:38:56,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:38:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:38:56,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 2365 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:38:56,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:38:56,893 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 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:38:56,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:38:56,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2019-09-08 04:38:56,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:38:56,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:38:56,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:38:56,912 INFO L87 Difference]: Start difference. First operand 495 states and 672 transitions. Second operand 13 states. [2019-09-08 04:38:58,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:38:58,575 INFO L93 Difference]: Finished difference Result 972 states and 1334 transitions. [2019-09-08 04:38:58,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:38:58,576 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 153 [2019-09-08 04:38:58,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:38:58,581 INFO L225 Difference]: With dead ends: 972 [2019-09-08 04:38:58,582 INFO L226 Difference]: Without dead ends: 513 [2019-09-08 04:38:58,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:38:58,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-09-08 04:38:58,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 511. [2019-09-08 04:38:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-09-08 04:38:58,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 693 transitions. [2019-09-08 04:38:58,624 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 693 transitions. Word has length 153 [2019-09-08 04:38:58,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:38:58,624 INFO L475 AbstractCegarLoop]: Abstraction has 511 states and 693 transitions. [2019-09-08 04:38:58,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:38:58,624 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 693 transitions. [2019-09-08 04:38:58,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 04:38:58,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:38:58,628 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:38:58,628 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:38:58,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:38:58,629 INFO L82 PathProgramCache]: Analyzing trace with hash 2095426242, now seen corresponding path program 1 times [2019-09-08 04:38:58,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:38:58,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:38:58,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:38:58,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:38:58,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:38:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:38:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:38:58,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:38:58,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:38:58,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:38:58,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:38:58,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:38:58,865 INFO L87 Difference]: Start difference. First operand 511 states and 693 transitions. Second operand 7 states. [2019-09-08 04:38:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:38:59,160 INFO L93 Difference]: Finished difference Result 970 states and 1323 transitions. [2019-09-08 04:38:59,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:38:59,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 155 [2019-09-08 04:38:59,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:38:59,164 INFO L225 Difference]: With dead ends: 970 [2019-09-08 04:38:59,165 INFO L226 Difference]: Without dead ends: 525 [2019-09-08 04:38:59,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:38:59,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-09-08 04:38:59,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 521. [2019-09-08 04:38:59,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-09-08 04:38:59,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 704 transitions. [2019-09-08 04:38:59,194 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 704 transitions. Word has length 155 [2019-09-08 04:38:59,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:38:59,195 INFO L475 AbstractCegarLoop]: Abstraction has 521 states and 704 transitions. [2019-09-08 04:38:59,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:38:59,195 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 704 transitions. [2019-09-08 04:38:59,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 04:38:59,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:38:59,198 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:38:59,199 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:38:59,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:38:59,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1279394685, now seen corresponding path program 2 times [2019-09-08 04:38:59,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:38:59,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:38:59,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:38:59,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:38:59,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:38:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:38:59,336 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:38:59,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:38:59,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:38:59,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:38:59,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:38:59,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:38:59,338 INFO L87 Difference]: Start difference. First operand 521 states and 704 transitions. Second operand 7 states. [2019-09-08 04:38:59,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:38:59,626 INFO L93 Difference]: Finished difference Result 968 states and 1322 transitions. [2019-09-08 04:38:59,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:38:59,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 156 [2019-09-08 04:38:59,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:38:59,630 INFO L225 Difference]: With dead ends: 968 [2019-09-08 04:38:59,631 INFO L226 Difference]: Without dead ends: 527 [2019-09-08 04:38:59,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:38:59,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-08 04:38:59,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 523. [2019-09-08 04:38:59,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-09-08 04:38:59,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 707 transitions. [2019-09-08 04:38:59,658 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 707 transitions. Word has length 156 [2019-09-08 04:38:59,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:38:59,659 INFO L475 AbstractCegarLoop]: Abstraction has 523 states and 707 transitions. [2019-09-08 04:38:59,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:38:59,659 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 707 transitions. [2019-09-08 04:38:59,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 04:38:59,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:38:59,663 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:38:59,663 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:38:59,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:38:59,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1097266557, now seen corresponding path program 1 times [2019-09-08 04:38:59,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:38:59,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:38:59,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:38:59,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 04:38:59,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:38:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:38:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:38:59,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:38:59,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:38:59,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:38:59,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:38:59,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:38:59,824 INFO L87 Difference]: Start difference. First operand 523 states and 707 transitions. Second operand 9 states. [2019-09-08 04:39:00,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:00,184 INFO L93 Difference]: Finished difference Result 973 states and 1328 transitions. [2019-09-08 04:39:00,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:39:00,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 157 [2019-09-08 04:39:00,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:00,191 INFO L225 Difference]: With dead ends: 973 [2019-09-08 04:39:00,191 INFO L226 Difference]: Without dead ends: 525 [2019-09-08 04:39:00,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:39:00,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-09-08 04:39:00,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 523. [2019-09-08 04:39:00,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-09-08 04:39:00,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 706 transitions. [2019-09-08 04:39:00,227 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 706 transitions. Word has length 157 [2019-09-08 04:39:00,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:00,227 INFO L475 AbstractCegarLoop]: Abstraction has 523 states and 706 transitions. [2019-09-08 04:39:00,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:39:00,228 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 706 transitions. [2019-09-08 04:39:00,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 04:39:00,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:00,231 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:39:00,232 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:00,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:00,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1298759037, now seen corresponding path program 2 times [2019-09-08 04:39:00,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:00,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:00,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:00,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:00,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:00,464 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:39:00,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:00,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:39:00,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:39:00,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:39:00,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:39:00,466 INFO L87 Difference]: Start difference. First operand 523 states and 706 transitions. Second operand 9 states. [2019-09-08 04:39:00,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:00,740 INFO L93 Difference]: Finished difference Result 975 states and 1329 transitions. [2019-09-08 04:39:00,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:39:00,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2019-09-08 04:39:00,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:00,744 INFO L225 Difference]: With dead ends: 975 [2019-09-08 04:39:00,744 INFO L226 Difference]: Without dead ends: 527 [2019-09-08 04:39:00,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:39:00,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-08 04:39:00,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 523. [2019-09-08 04:39:00,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-09-08 04:39:00,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 705 transitions. [2019-09-08 04:39:00,771 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 705 transitions. Word has length 158 [2019-09-08 04:39:00,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:00,772 INFO L475 AbstractCegarLoop]: Abstraction has 523 states and 705 transitions. [2019-09-08 04:39:00,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:39:00,772 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 705 transitions. [2019-09-08 04:39:00,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 04:39:00,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:00,775 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:39:00,776 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:00,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:00,776 INFO L82 PathProgramCache]: Analyzing trace with hash 752988868, now seen corresponding path program 1 times [2019-09-08 04:39:00,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:00,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:00,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:00,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 04:39:00,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:01,056 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:39:01,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:01,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:39:01,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:39:01,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:39:01,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:39:01,059 INFO L87 Difference]: Start difference. First operand 523 states and 705 transitions. Second operand 9 states. [2019-09-08 04:39:01,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:01,544 INFO L93 Difference]: Finished difference Result 975 states and 1328 transitions. [2019-09-08 04:39:01,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:39:01,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 159 [2019-09-08 04:39:01,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:01,550 INFO L225 Difference]: With dead ends: 975 [2019-09-08 04:39:01,551 INFO L226 Difference]: Without dead ends: 527 [2019-09-08 04:39:01,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:39:01,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-08 04:39:01,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 523. [2019-09-08 04:39:01,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-09-08 04:39:01,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 704 transitions. [2019-09-08 04:39:01,588 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 704 transitions. Word has length 159 [2019-09-08 04:39:01,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:01,589 INFO L475 AbstractCegarLoop]: Abstraction has 523 states and 704 transitions. [2019-09-08 04:39:01,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:39:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 704 transitions. [2019-09-08 04:39:01,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 04:39:01,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:01,595 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:39:01,595 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:01,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:01,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1601396414, now seen corresponding path program 1 times [2019-09-08 04:39:01,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:01,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:01,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:01,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:01,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:01,996 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:39:01,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:01,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 04:39:01,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 04:39:01,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 04:39:01,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:39:01,999 INFO L87 Difference]: Start difference. First operand 523 states and 704 transitions. Second operand 18 states. [2019-09-08 04:39:06,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:06,296 INFO L93 Difference]: Finished difference Result 1408 states and 1901 transitions. [2019-09-08 04:39:06,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 04:39:06,297 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 159 [2019-09-08 04:39:06,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:06,308 INFO L225 Difference]: With dead ends: 1408 [2019-09-08 04:39:06,308 INFO L226 Difference]: Without dead ends: 1200 [2019-09-08 04:39:06,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1549, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 04:39:06,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2019-09-08 04:39:06,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1177. [2019-09-08 04:39:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2019-09-08 04:39:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1611 transitions. [2019-09-08 04:39:06,371 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1611 transitions. Word has length 159 [2019-09-08 04:39:06,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:06,372 INFO L475 AbstractCegarLoop]: Abstraction has 1177 states and 1611 transitions. [2019-09-08 04:39:06,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 04:39:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1611 transitions. [2019-09-08 04:39:06,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 04:39:06,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:06,376 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:39:06,377 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:06,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:06,377 INFO L82 PathProgramCache]: Analyzing trace with hash 838711399, now seen corresponding path program 1 times [2019-09-08 04:39:06,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:06,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:06,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:06,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:06,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:06,585 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:39:06,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:06,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:39:06,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:39:06,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:39:06,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:39:06,588 INFO L87 Difference]: Start difference. First operand 1177 states and 1611 transitions. Second operand 10 states. [2019-09-08 04:39:06,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:06,800 INFO L93 Difference]: Finished difference Result 1849 states and 2481 transitions. [2019-09-08 04:39:06,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:39:06,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 160 [2019-09-08 04:39:06,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:06,812 INFO L225 Difference]: With dead ends: 1849 [2019-09-08 04:39:06,812 INFO L226 Difference]: Without dead ends: 1208 [2019-09-08 04:39:06,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:39:06,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2019-09-08 04:39:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1203. [2019-09-08 04:39:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-09-08 04:39:06,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1650 transitions. [2019-09-08 04:39:06,910 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1650 transitions. Word has length 160 [2019-09-08 04:39:06,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:06,911 INFO L475 AbstractCegarLoop]: Abstraction has 1203 states and 1650 transitions. [2019-09-08 04:39:06,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:39:06,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1650 transitions. [2019-09-08 04:39:06,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 04:39:06,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:06,918 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:39:06,918 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:06,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:06,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1360707865, now seen corresponding path program 1 times [2019-09-08 04:39:06,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:06,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:06,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:06,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:06,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:07,154 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:39:07,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:07,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:39:07,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:39:07,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:39:07,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:39:07,156 INFO L87 Difference]: Start difference. First operand 1203 states and 1650 transitions. Second operand 5 states. [2019-09-08 04:39:08,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:08,273 INFO L93 Difference]: Finished difference Result 2975 states and 4024 transitions. [2019-09-08 04:39:08,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:39:08,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-09-08 04:39:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:08,290 INFO L225 Difference]: With dead ends: 2975 [2019-09-08 04:39:08,290 INFO L226 Difference]: Without dead ends: 2540 [2019-09-08 04:39:08,293 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:39:08,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2019-09-08 04:39:08,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 2518. [2019-09-08 04:39:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2518 states. [2019-09-08 04:39:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 3425 transitions. [2019-09-08 04:39:08,445 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 3425 transitions. Word has length 160 [2019-09-08 04:39:08,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:08,445 INFO L475 AbstractCegarLoop]: Abstraction has 2518 states and 3425 transitions. [2019-09-08 04:39:08,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:39:08,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 3425 transitions. [2019-09-08 04:39:08,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 04:39:08,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:08,451 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:39:08,451 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:08,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:08,452 INFO L82 PathProgramCache]: Analyzing trace with hash -649395976, now seen corresponding path program 1 times [2019-09-08 04:39:08,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:08,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:08,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:08,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:08,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:08,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:39:08,562 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) [2019-09-08 04:39:08,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:39:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:08,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 2371 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:39:08,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:39:08,953 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:08,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:39:08,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 04:39:08,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:39:08,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:39:08,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:39:08,963 INFO L87 Difference]: Start difference. First operand 2518 states and 3425 transitions. Second operand 5 states. [2019-09-08 04:39:09,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:09,111 INFO L93 Difference]: Finished difference Result 4382 states and 5852 transitions. [2019-09-08 04:39:09,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:39:09,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-09-08 04:39:09,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:09,130 INFO L225 Difference]: With dead ends: 4382 [2019-09-08 04:39:09,130 INFO L226 Difference]: Without dead ends: 2588 [2019-09-08 04:39:09,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:39:09,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2588 states. [2019-09-08 04:39:09,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2588 to 2581. [2019-09-08 04:39:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2581 states. [2019-09-08 04:39:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2581 states and 3528 transitions. [2019-09-08 04:39:09,365 INFO L78 Accepts]: Start accepts. Automaton has 2581 states and 3528 transitions. Word has length 160 [2019-09-08 04:39:09,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:09,368 INFO L475 AbstractCegarLoop]: Abstraction has 2581 states and 3528 transitions. [2019-09-08 04:39:09,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:39:09,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 3528 transitions. [2019-09-08 04:39:09,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 04:39:09,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:09,376 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 04:39:09,376 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:09,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:09,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1244659563, now seen corresponding path program 1 times [2019-09-08 04:39:09,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:09,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:09,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:09,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:09,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:09,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:09,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:09,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:09,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:09,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:09,496 INFO L87 Difference]: Start difference. First operand 2581 states and 3528 transitions. Second operand 3 states. [2019-09-08 04:39:09,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:09,580 INFO L93 Difference]: Finished difference Result 5306 states and 7387 transitions. [2019-09-08 04:39:09,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:09,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-08 04:39:09,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:09,596 INFO L225 Difference]: With dead ends: 5306 [2019-09-08 04:39:09,596 INFO L226 Difference]: Without dead ends: 2829 [2019-09-08 04:39:09,604 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:39:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2019-09-08 04:39:09,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2826. [2019-09-08 04:39:09,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2826 states. [2019-09-08 04:39:09,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 3970 transitions. [2019-09-08 04:39:09,807 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 3970 transitions. Word has length 166 [2019-09-08 04:39:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:09,808 INFO L475 AbstractCegarLoop]: Abstraction has 2826 states and 3970 transitions. [2019-09-08 04:39:09,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:09,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3970 transitions. [2019-09-08 04:39:09,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 04:39:09,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:09,819 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] [2019-09-08 04:39:09,819 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:09,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:09,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1554148143, now seen corresponding path program 2 times [2019-09-08 04:39:09,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:09,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:09,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:09,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:09,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:10,001 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:10,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:10,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:39:10,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:39:10,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:39:10,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:39:10,007 INFO L87 Difference]: Start difference. First operand 2826 states and 3970 transitions. Second operand 6 states. [2019-09-08 04:39:10,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:10,110 INFO L93 Difference]: Finished difference Result 5501 states and 7739 transitions. [2019-09-08 04:39:10,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:39:10,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-08 04:39:10,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:10,128 INFO L225 Difference]: With dead ends: 5501 [2019-09-08 04:39:10,128 INFO L226 Difference]: Without dead ends: 2829 [2019-09-08 04:39:10,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:39:10,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2019-09-08 04:39:10,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2826. [2019-09-08 04:39:10,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2826 states. [2019-09-08 04:39:10,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 3964 transitions. [2019-09-08 04:39:10,315 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 3964 transitions. Word has length 167 [2019-09-08 04:39:10,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:10,316 INFO L475 AbstractCegarLoop]: Abstraction has 2826 states and 3964 transitions. [2019-09-08 04:39:10,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:39:10,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3964 transitions. [2019-09-08 04:39:10,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 04:39:10,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:10,332 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 04:39:10,332 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:10,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:10,332 INFO L82 PathProgramCache]: Analyzing trace with hash -424318208, now seen corresponding path program 1 times [2019-09-08 04:39:10,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:10,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:10,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:10,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 04:39:10,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:10,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:10,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:10,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:10,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:10,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:10,562 INFO L87 Difference]: Start difference. First operand 2826 states and 3964 transitions. Second operand 3 states. [2019-09-08 04:39:10,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:10,672 INFO L93 Difference]: Finished difference Result 6003 states and 8638 transitions. [2019-09-08 04:39:10,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:10,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-08 04:39:10,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:10,694 INFO L225 Difference]: With dead ends: 6003 [2019-09-08 04:39:10,695 INFO L226 Difference]: Without dead ends: 3287 [2019-09-08 04:39:10,707 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:39:10,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3287 states. [2019-09-08 04:39:10,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3287 to 3284. [2019-09-08 04:39:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3284 states. [2019-09-08 04:39:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3284 states to 3284 states and 4787 transitions. [2019-09-08 04:39:10,887 INFO L78 Accepts]: Start accepts. Automaton has 3284 states and 4787 transitions. Word has length 167 [2019-09-08 04:39:10,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:10,887 INFO L475 AbstractCegarLoop]: Abstraction has 3284 states and 4787 transitions. [2019-09-08 04:39:10,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3284 states and 4787 transitions. [2019-09-08 04:39:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 04:39:10,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:10,899 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 04:39:10,899 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:10,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:10,899 INFO L82 PathProgramCache]: Analyzing trace with hash -740180269, now seen corresponding path program 1 times [2019-09-08 04:39:10,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:10,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:10,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:10,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:10,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:11,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:11,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:11,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:11,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:11,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:11,032 INFO L87 Difference]: Start difference. First operand 3284 states and 4787 transitions. Second operand 3 states. [2019-09-08 04:39:11,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:11,173 INFO L93 Difference]: Finished difference Result 7335 states and 11014 transitions. [2019-09-08 04:39:11,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:11,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-08 04:39:11,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:11,212 INFO L225 Difference]: With dead ends: 7335 [2019-09-08 04:39:11,212 INFO L226 Difference]: Without dead ends: 4169 [2019-09-08 04:39:11,224 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:39:11,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4169 states. [2019-09-08 04:39:11,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4169 to 4166. [2019-09-08 04:39:11,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4166 states. [2019-09-08 04:39:11,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 4166 states and 6340 transitions. [2019-09-08 04:39:11,487 INFO L78 Accepts]: Start accepts. Automaton has 4166 states and 6340 transitions. Word has length 168 [2019-09-08 04:39:11,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:11,488 INFO L475 AbstractCegarLoop]: Abstraction has 4166 states and 6340 transitions. [2019-09-08 04:39:11,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:11,488 INFO L276 IsEmpty]: Start isEmpty. Operand 4166 states and 6340 transitions. [2019-09-08 04:39:11,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 04:39:11,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:11,503 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:11,504 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:11,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:11,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2132595456, now seen corresponding path program 1 times [2019-09-08 04:39:11,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:11,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:11,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:11,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:11,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:11,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:11,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:11,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:11,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:11,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:11,623 INFO L87 Difference]: Start difference. First operand 4166 states and 6340 transitions. Second operand 3 states. [2019-09-08 04:39:11,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:11,911 INFO L93 Difference]: Finished difference Result 9891 states and 15508 transitions. [2019-09-08 04:39:11,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:11,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-09-08 04:39:11,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:11,941 INFO L225 Difference]: With dead ends: 9891 [2019-09-08 04:39:11,941 INFO L226 Difference]: Without dead ends: 5855 [2019-09-08 04:39:11,956 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:39:11,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5855 states. [2019-09-08 04:39:12,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5855 to 5852. [2019-09-08 04:39:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5852 states. [2019-09-08 04:39:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5852 states to 5852 states and 9273 transitions. [2019-09-08 04:39:12,272 INFO L78 Accepts]: Start accepts. Automaton has 5852 states and 9273 transitions. Word has length 169 [2019-09-08 04:39:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:12,273 INFO L475 AbstractCegarLoop]: Abstraction has 5852 states and 9273 transitions. [2019-09-08 04:39:12,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 5852 states and 9273 transitions. [2019-09-08 04:39:12,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 04:39:12,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:12,298 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:12,298 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:12,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:12,298 INFO L82 PathProgramCache]: Analyzing trace with hash -398253357, now seen corresponding path program 1 times [2019-09-08 04:39:12,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:12,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:12,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:12,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:12,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:12,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:12,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:12,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:12,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:12,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:12,415 INFO L87 Difference]: Start difference. First operand 5852 states and 9273 transitions. Second operand 3 states. [2019-09-08 04:39:12,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:12,705 INFO L93 Difference]: Finished difference Result 14785 states and 24094 transitions. [2019-09-08 04:39:12,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:12,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-08 04:39:12,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:12,753 INFO L225 Difference]: With dead ends: 14785 [2019-09-08 04:39:12,753 INFO L226 Difference]: Without dead ends: 9073 [2019-09-08 04:39:12,778 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:39:12,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9073 states. [2019-09-08 04:39:13,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9073 to 9070. [2019-09-08 04:39:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9070 states. [2019-09-08 04:39:13,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9070 states to 9070 states and 14890 transitions. [2019-09-08 04:39:13,369 INFO L78 Accepts]: Start accepts. Automaton has 9070 states and 14890 transitions. Word has length 170 [2019-09-08 04:39:13,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:13,370 INFO L475 AbstractCegarLoop]: Abstraction has 9070 states and 14890 transitions. [2019-09-08 04:39:13,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 9070 states and 14890 transitions. [2019-09-08 04:39:13,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 04:39:13,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:13,403 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:13,403 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:13,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:13,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1180869376, now seen corresponding path program 1 times [2019-09-08 04:39:13,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:13,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:13,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:13,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:13,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:13,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:13,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:13,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:13,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:13,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:13,510 INFO L87 Difference]: Start difference. First operand 9070 states and 14890 transitions. Second operand 3 states. [2019-09-08 04:39:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:14,082 INFO L93 Difference]: Finished difference Result 24143 states and 40456 transitions. [2019-09-08 04:39:14,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:14,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-08 04:39:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:14,159 INFO L225 Difference]: With dead ends: 24143 [2019-09-08 04:39:14,160 INFO L226 Difference]: Without dead ends: 15219 [2019-09-08 04:39:14,198 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:39:14,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15219 states. [2019-09-08 04:39:15,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15219 to 15216. [2019-09-08 04:39:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15216 states. [2019-09-08 04:39:15,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15216 states to 15216 states and 25547 transitions. [2019-09-08 04:39:15,804 INFO L78 Accepts]: Start accepts. Automaton has 15216 states and 25547 transitions. Word has length 171 [2019-09-08 04:39:15,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:15,804 INFO L475 AbstractCegarLoop]: Abstraction has 15216 states and 25547 transitions. [2019-09-08 04:39:15,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:15,804 INFO L276 IsEmpty]: Start isEmpty. Operand 15216 states and 25547 transitions. [2019-09-08 04:39:15,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 04:39:15,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:15,850 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:15,850 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:15,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:15,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1635909509, now seen corresponding path program 1 times [2019-09-08 04:39:15,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:15,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:15,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:15,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:15,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:15,971 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 04:39:15,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:39:15,972 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:39:15,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:16,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 2435 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:39:16,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:39:16,415 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:39:16,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:39:16,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 04:39:16,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:39:16,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:39:16,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:39:16,432 INFO L87 Difference]: Start difference. First operand 15216 states and 25547 transitions. Second operand 6 states. [2019-09-08 04:39:17,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:17,033 INFO L93 Difference]: Finished difference Result 17898 states and 29283 transitions. [2019-09-08 04:39:17,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:39:17,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-09-08 04:39:17,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:17,099 INFO L225 Difference]: With dead ends: 17898 [2019-09-08 04:39:17,099 INFO L226 Difference]: Without dead ends: 16104 [2019-09-08 04:39:17,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:39:17,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16104 states. [2019-09-08 04:39:17,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16104 to 16025. [2019-09-08 04:39:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16025 states. [2019-09-08 04:39:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16025 states to 16025 states and 26818 transitions. [2019-09-08 04:39:18,038 INFO L78 Accepts]: Start accepts. Automaton has 16025 states and 26818 transitions. Word has length 178 [2019-09-08 04:39:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:18,039 INFO L475 AbstractCegarLoop]: Abstraction has 16025 states and 26818 transitions. [2019-09-08 04:39:18,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:39:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand 16025 states and 26818 transitions. [2019-09-08 04:39:18,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 04:39:18,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:18,117 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:18,117 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:18,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:18,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1175854803, now seen corresponding path program 1 times [2019-09-08 04:39:18,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:18,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:18,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:18,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:18,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:18,247 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:18,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:18,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:18,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:18,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:18,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:18,252 INFO L87 Difference]: Start difference. First operand 16025 states and 26818 transitions. Second operand 3 states. [2019-09-08 04:39:19,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:19,256 INFO L93 Difference]: Finished difference Result 44001 states and 74580 transitions. [2019-09-08 04:39:19,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:19,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-08 04:39:19,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:19,384 INFO L225 Difference]: With dead ends: 44001 [2019-09-08 04:39:19,384 INFO L226 Difference]: Without dead ends: 28592 [2019-09-08 04:39:19,435 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:39:19,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28592 states. [2019-09-08 04:39:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28592 to 28589. [2019-09-08 04:39:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28589 states. [2019-09-08 04:39:21,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28589 states to 28589 states and 48230 transitions. [2019-09-08 04:39:21,134 INFO L78 Accepts]: Start accepts. Automaton has 28589 states and 48230 transitions. Word has length 172 [2019-09-08 04:39:21,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:21,135 INFO L475 AbstractCegarLoop]: Abstraction has 28589 states and 48230 transitions. [2019-09-08 04:39:21,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:21,135 INFO L276 IsEmpty]: Start isEmpty. Operand 28589 states and 48230 transitions. [2019-09-08 04:39:21,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 04:39:21,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:21,211 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:21,211 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:21,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:21,212 INFO L82 PathProgramCache]: Analyzing trace with hash 965139200, now seen corresponding path program 1 times [2019-09-08 04:39:21,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:21,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:21,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:21,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:21,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:21,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:21,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:21,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:21,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:21,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:21,345 INFO L87 Difference]: Start difference. First operand 28589 states and 48230 transitions. Second operand 3 states. [2019-09-08 04:39:23,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:23,721 INFO L93 Difference]: Finished difference Result 79645 states and 134802 transitions. [2019-09-08 04:39:23,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:23,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-08 04:39:23,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:23,974 INFO L225 Difference]: With dead ends: 79645 [2019-09-08 04:39:23,974 INFO L226 Difference]: Without dead ends: 51806 [2019-09-08 04:39:24,055 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:39:24,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51806 states. [2019-09-08 04:39:26,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51806 to 51803. [2019-09-08 04:39:26,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51803 states. [2019-09-08 04:39:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51803 states to 51803 states and 86861 transitions. [2019-09-08 04:39:26,622 INFO L78 Accepts]: Start accepts. Automaton has 51803 states and 86861 transitions. Word has length 173 [2019-09-08 04:39:26,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:26,623 INFO L475 AbstractCegarLoop]: Abstraction has 51803 states and 86861 transitions. [2019-09-08 04:39:26,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 51803 states and 86861 transitions. [2019-09-08 04:39:26,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 04:39:26,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:26,685 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:26,686 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:26,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:26,686 INFO L82 PathProgramCache]: Analyzing trace with hash -227044399, now seen corresponding path program 1 times [2019-09-08 04:39:26,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:26,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:26,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:26,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:26,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:26,796 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:26,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:26,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:26,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:26,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:26,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:26,798 INFO L87 Difference]: Start difference. First operand 51803 states and 86861 transitions. Second operand 3 states. [2019-09-08 04:39:30,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:30,686 INFO L93 Difference]: Finished difference Result 146509 states and 246954 transitions. [2019-09-08 04:39:30,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:30,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-08 04:39:30,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:31,057 INFO L225 Difference]: With dead ends: 146509 [2019-09-08 04:39:31,057 INFO L226 Difference]: Without dead ends: 95672 [2019-09-08 04:39:31,181 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:39:31,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95672 states. [2019-09-08 04:39:36,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95672 to 95669. [2019-09-08 04:39:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95669 states. [2019-09-08 04:39:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95669 states to 95669 states and 159920 transitions. [2019-09-08 04:39:36,627 INFO L78 Accepts]: Start accepts. Automaton has 95669 states and 159920 transitions. Word has length 174 [2019-09-08 04:39:36,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:36,627 INFO L475 AbstractCegarLoop]: Abstraction has 95669 states and 159920 transitions. [2019-09-08 04:39:36,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:36,628 INFO L276 IsEmpty]: Start isEmpty. Operand 95669 states and 159920 transitions. [2019-09-08 04:39:36,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 04:39:36,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:36,686 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 04:39:36,686 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:36,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:36,686 INFO L82 PathProgramCache]: Analyzing trace with hash 933599936, now seen corresponding path program 1 times [2019-09-08 04:39:36,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:36,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:36,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:36,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:36,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:36,851 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:36,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:36,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:36,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:36,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:36,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:36,854 INFO L87 Difference]: Start difference. First operand 95669 states and 159920 transitions. Second operand 3 states. [2019-09-08 04:39:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:43,544 INFO L93 Difference]: Finished difference Result 180566 states and 299160 transitions. [2019-09-08 04:39:43,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:43,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-08 04:39:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:43,992 INFO L225 Difference]: With dead ends: 180566 [2019-09-08 04:39:43,993 INFO L226 Difference]: Without dead ends: 178772 [2019-09-08 04:39:44,045 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:39:44,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178772 states. [2019-09-08 04:39:53,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178772 to 178769. [2019-09-08 04:39:53,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178769 states. [2019-09-08 04:39:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178769 states to 178769 states and 293752 transitions. [2019-09-08 04:39:54,212 INFO L78 Accepts]: Start accepts. Automaton has 178769 states and 293752 transitions. Word has length 175 [2019-09-08 04:39:54,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:54,213 INFO L475 AbstractCegarLoop]: Abstraction has 178769 states and 293752 transitions. [2019-09-08 04:39:54,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:54,213 INFO L276 IsEmpty]: Start isEmpty. Operand 178769 states and 293752 transitions. [2019-09-08 04:39:54,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 04:39:54,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:54,277 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 04:39:54,277 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:54,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:54,277 INFO L82 PathProgramCache]: Analyzing trace with hash 735418385, now seen corresponding path program 1 times [2019-09-08 04:39:54,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:54,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:54,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:54,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:54,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:54,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:54,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:54,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:54,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:54,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:54,781 INFO L87 Difference]: Start difference. First operand 178769 states and 293752 transitions. Second operand 3 states. [2019-09-08 04:40:03,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:03,557 INFO L93 Difference]: Finished difference Result 180858 states and 296457 transitions. [2019-09-08 04:40:03,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:40:03,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 04:40:03,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:04,375 INFO L225 Difference]: With dead ends: 180858 [2019-09-08 04:40:04,375 INFO L226 Difference]: Without dead ends: 179154 [2019-09-08 04:40:04,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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:40:04,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179154 states. [2019-09-08 04:40:12,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179154 to 179148. [2019-09-08 04:40:12,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179148 states. [2019-09-08 04:40:12,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179148 states to 179148 states and 294218 transitions. [2019-09-08 04:40:12,932 INFO L78 Accepts]: Start accepts. Automaton has 179148 states and 294218 transitions. Word has length 176 [2019-09-08 04:40:12,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:12,933 INFO L475 AbstractCegarLoop]: Abstraction has 179148 states and 294218 transitions. [2019-09-08 04:40:12,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:40:12,933 INFO L276 IsEmpty]: Start isEmpty. Operand 179148 states and 294218 transitions. [2019-09-08 04:40:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-09-08 04:40:13,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:13,583 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 04:40:13,583 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:13,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:13,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1533520304, now seen corresponding path program 1 times [2019-09-08 04:40:13,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:13,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:13,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:13,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:13,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-08 04:40:13,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:13,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:40:13,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:40:13,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:40:13,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:40:13,737 INFO L87 Difference]: Start difference. First operand 179148 states and 294218 transitions. Second operand 5 states. [2019-09-08 04:40:21,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:21,683 INFO L93 Difference]: Finished difference Result 180156 states and 295462 transitions. [2019-09-08 04:40:21,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:40:21,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2019-09-08 04:40:21,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:22,237 INFO L225 Difference]: With dead ends: 180156 [2019-09-08 04:40:22,237 INFO L226 Difference]: Without dead ends: 178803 [2019-09-08 04:40:22,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:40:22,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178803 states. [2019-09-08 04:40:30,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178803 to 178391. [2019-09-08 04:40:30,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178391 states. [2019-09-08 04:40:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178391 states to 178391 states and 293220 transitions. [2019-09-08 04:40:31,584 INFO L78 Accepts]: Start accepts. Automaton has 178391 states and 293220 transitions. Word has length 279 [2019-09-08 04:40:31,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:31,585 INFO L475 AbstractCegarLoop]: Abstraction has 178391 states and 293220 transitions. [2019-09-08 04:40:31,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:40:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand 178391 states and 293220 transitions. [2019-09-08 04:40:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-08 04:40:32,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:32,254 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 04:40:32,254 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:32,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:32,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1552551882, now seen corresponding path program 1 times [2019-09-08 04:40:32,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:32,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:32,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:32,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:32,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:32,519 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-08 04:40:32,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:32,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:40:32,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:40:32,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:40:32,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:40:32,521 INFO L87 Difference]: Start difference. First operand 178391 states and 293220 transitions. Second operand 11 states. [2019-09-08 04:40:45,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:45,393 INFO L93 Difference]: Finished difference Result 178956 states and 293912 transitions. [2019-09-08 04:40:45,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:40:45,393 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 280 [2019-09-08 04:40:45,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:46,058 INFO L225 Difference]: With dead ends: 178956 [2019-09-08 04:40:46,059 INFO L226 Difference]: Without dead ends: 178495 [2019-09-08 04:40:46,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:40:46,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178495 states. [2019-09-08 04:40:58,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178495 to 178196. [2019-09-08 04:40:58,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178196 states. [2019-09-08 04:40:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178196 states to 178196 states and 292946 transitions. [2019-09-08 04:40:58,769 INFO L78 Accepts]: Start accepts. Automaton has 178196 states and 292946 transitions. Word has length 280 [2019-09-08 04:40:58,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:58,769 INFO L475 AbstractCegarLoop]: Abstraction has 178196 states and 292946 transitions. [2019-09-08 04:40:58,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:40:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 178196 states and 292946 transitions. [2019-09-08 04:40:59,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-08 04:40:59,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:59,382 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:40:59,383 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:59,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:59,383 INFO L82 PathProgramCache]: Analyzing trace with hash -398912091, now seen corresponding path program 1 times [2019-09-08 04:40:59,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:59,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:59,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:59,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:59,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-08 04:40:59,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:59,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:40:59,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:40:59,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:40:59,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:40:59,639 INFO L87 Difference]: Start difference. First operand 178196 states and 292946 transitions. Second operand 7 states. [2019-09-08 04:41:15,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:41:15,291 INFO L93 Difference]: Finished difference Result 354993 states and 586409 transitions. [2019-09-08 04:41:15,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:41:15,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 342 [2019-09-08 04:41:15,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:41:16,490 INFO L225 Difference]: With dead ends: 354993 [2019-09-08 04:41:16,490 INFO L226 Difference]: Without dead ends: 354287 [2019-09-08 04:41:16,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:41:16,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354287 states. [2019-09-08 04:41:46,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354287 to 353725. [2019-09-08 04:41:46,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353725 states. [2019-09-08 04:41:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353725 states to 353725 states and 584875 transitions. [2019-09-08 04:41:48,502 INFO L78 Accepts]: Start accepts. Automaton has 353725 states and 584875 transitions. Word has length 342 [2019-09-08 04:41:48,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:41:48,503 INFO L475 AbstractCegarLoop]: Abstraction has 353725 states and 584875 transitions. [2019-09-08 04:41:48,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:41:48,503 INFO L276 IsEmpty]: Start isEmpty. Operand 353725 states and 584875 transitions. [2019-09-08 04:41:49,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-09-08 04:41:49,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:41:49,814 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:41:49,814 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:41:49,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:41:49,815 INFO L82 PathProgramCache]: Analyzing trace with hash -74236452, now seen corresponding path program 1 times [2019-09-08 04:41:49,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:41:49,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:41:49,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:41:49,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:41:49,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:41:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:41:50,013 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-08 04:41:50,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:41:50,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:41:50,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:41:50,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:41:50,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:41:50,015 INFO L87 Difference]: Start difference. First operand 353725 states and 584875 transitions. Second operand 9 states. [2019-09-08 04:42:06,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:42:06,601 INFO L93 Difference]: Finished difference Result 354235 states and 585536 transitions. [2019-09-08 04:42:06,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:42:06,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 343 [2019-09-08 04:42:06,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:42:08,238 INFO L225 Difference]: With dead ends: 354235 [2019-09-08 04:42:08,239 INFO L226 Difference]: Without dead ends: 353809 [2019-09-08 04:42:08,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:42:08,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353809 states. [2019-09-08 04:42:35,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353809 to 353743. [2019-09-08 04:42:35,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353743 states. [2019-09-08 04:42:37,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353743 states to 353743 states and 584917 transitions. [2019-09-08 04:42:37,039 INFO L78 Accepts]: Start accepts. Automaton has 353743 states and 584917 transitions. Word has length 343 [2019-09-08 04:42:37,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:42:37,040 INFO L475 AbstractCegarLoop]: Abstraction has 353743 states and 584917 transitions. [2019-09-08 04:42:37,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:42:37,040 INFO L276 IsEmpty]: Start isEmpty. Operand 353743 states and 584917 transitions. [2019-09-08 04:42:38,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-08 04:42:38,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:42:38,531 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:42:38,531 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:42:38,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:42:38,532 INFO L82 PathProgramCache]: Analyzing trace with hash 151989711, now seen corresponding path program 1 times [2019-09-08 04:42:38,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:42:38,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:42:38,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:42:38,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:42:38,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:42:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:42:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-08 04:42:39,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:42:39,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:42:39,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:42:39,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:42:39,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:42:39,552 INFO L87 Difference]: Start difference. First operand 353743 states and 584917 transitions. Second operand 7 states. [2019-09-08 04:43:12,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:43:12,920 INFO L93 Difference]: Finished difference Result 706920 states and 1174353 transitions. [2019-09-08 04:43:12,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:43:12,920 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 344 [2019-09-08 04:43:12,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:43:22,753 INFO L225 Difference]: With dead ends: 706920 [2019-09-08 04:43:22,753 INFO L226 Difference]: Without dead ends: 705718 [2019-09-08 04:43:22,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:43:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705718 states. [2019-09-08 04:44:21,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705718 to 705144. [2019-09-08 04:44:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705144 states. [2019-09-08 04:44:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705144 states to 705144 states and 1172238 transitions. [2019-09-08 04:44:23,910 INFO L78 Accepts]: Start accepts. Automaton has 705144 states and 1172238 transitions. Word has length 344 [2019-09-08 04:44:23,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:44:23,910 INFO L475 AbstractCegarLoop]: Abstraction has 705144 states and 1172238 transitions. [2019-09-08 04:44:23,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:44:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 705144 states and 1172238 transitions. [2019-09-08 04:44:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-09-08 04:44:26,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:44:26,961 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:44:26,961 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:44:26,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:44:26,961 INFO L82 PathProgramCache]: Analyzing trace with hash 543077878, now seen corresponding path program 1 times [2019-09-08 04:44:26,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:44:26,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:44:26,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:44:26,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:44:26,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:44:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:44:28,301 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-08 04:44:28,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:44:28,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:44:28,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:44:28,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:44:28,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:44:28,304 INFO L87 Difference]: Start difference. First operand 705144 states and 1172238 transitions. Second operand 9 states. [2019-09-08 04:45:04,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:45:04,191 INFO L93 Difference]: Finished difference Result 705908 states and 1173247 transitions. [2019-09-08 04:45:04,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:45:04,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 345 [2019-09-08 04:45:04,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:45:07,298 INFO L225 Difference]: With dead ends: 705908 [2019-09-08 04:45:07,298 INFO L226 Difference]: Without dead ends: 705310 [2019-09-08 04:45:07,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:45:07,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705310 states. [2019-09-08 04:46:11,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705310 to 705242. [2019-09-08 04:46:11,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705242 states. [2019-09-08 04:46:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705242 states to 705242 states and 1172394 transitions. [2019-09-08 04:46:13,214 INFO L78 Accepts]: Start accepts. Automaton has 705242 states and 1172394 transitions. Word has length 345 [2019-09-08 04:46:13,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:46:13,214 INFO L475 AbstractCegarLoop]: Abstraction has 705242 states and 1172394 transitions. [2019-09-08 04:46:13,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:46:13,214 INFO L276 IsEmpty]: Start isEmpty. Operand 705242 states and 1172394 transitions. [2019-09-08 04:46:18,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-09-08 04:46:18,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:46:18,098 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:46:18,099 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:46:18,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:46:18,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1192402011, now seen corresponding path program 1 times [2019-09-08 04:46:18,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:46:18,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:46:18,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:18,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:46:18,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:18,305 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-08 04:46:18,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:46:18,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:46:18,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:46:18,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:46:18,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:46:18,307 INFO L87 Difference]: Start difference. First operand 705242 states and 1172394 transitions. Second operand 7 states. [2019-09-08 04:47:38,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:47:38,401 INFO L93 Difference]: Finished difference Result 1409578 states and 2355003 transitions. [2019-09-08 04:47:38,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:47:38,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 346 [2019-09-08 04:47:38,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:47:43,412 INFO L225 Difference]: With dead ends: 1409578 [2019-09-08 04:47:43,412 INFO L226 Difference]: Without dead ends: 1406793 [2019-09-08 04:47:43,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:47:45,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406793 states.