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_product33.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:45:45,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:45:45,086 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:45:45,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:45:45,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:45:45,108 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:45:45,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:45:45,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:45:45,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:45:45,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:45:45,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:45:45,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:45:45,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:45:45,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:45:45,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:45:45,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:45:45,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:45:45,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:45:45,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:45:45,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:45:45,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:45:45,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:45:45,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:45:45,164 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:45:45,167 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:45:45,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:45:45,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:45:45,170 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:45:45,171 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:45:45,172 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:45:45,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:45:45,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:45:45,174 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:45:45,175 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:45:45,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:45:45,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:45:45,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:45:45,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:45:45,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:45:45,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:45:45,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:45:45,184 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:45:45,209 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:45:45,209 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:45:45,212 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:45:45,212 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:45:45,212 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:45:45,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:45:45,213 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:45:45,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:45:45,213 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:45:45,213 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:45:45,215 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:45:45,215 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:45:45,215 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:45:45,216 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:45:45,216 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:45:45,216 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:45:45,216 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:45:45,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:45:45,217 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:45:45,217 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:45:45,217 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:45:45,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:45:45,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:45:45,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:45:45,218 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:45:45,218 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:45:45,219 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:45:45,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:45:45,219 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:45:45,261 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:45:45,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:45:45,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:45:45,286 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:45:45,286 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:45:45,287 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec1_product33.cil.c [2019-09-08 04:45:45,356 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc40846c3/c18fb66c34c7432ba886e37af05cc612/FLAG52494aacb [2019-09-08 04:45:46,018 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:45:46,019 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product33.cil.c [2019-09-08 04:45:46,050 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc40846c3/c18fb66c34c7432ba886e37af05cc612/FLAG52494aacb [2019-09-08 04:45:46,157 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc40846c3/c18fb66c34c7432ba886e37af05cc612 [2019-09-08 04:45:46,172 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:45:46,173 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:45:46,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:45:46,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:45:46,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:45:46,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:45:46" (1/1) ... [2019-09-08 04:45:46,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e8da460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:45:46, skipping insertion in model container [2019-09-08 04:45:46,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:45:46" (1/1) ... [2019-09-08 04:45:46,188 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:45:46,265 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:45:47,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:45:47,065 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:45:47,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:45:47,343 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:45:47,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:45:47 WrapperNode [2019-09-08 04:45:47,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:45:47,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:45:47,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:45:47,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:45:47,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:45:47" (1/1) ... [2019-09-08 04:45:47,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:45:47" (1/1) ... [2019-09-08 04:45:47,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:45:47" (1/1) ... [2019-09-08 04:45:47,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:45:47" (1/1) ... [2019-09-08 04:45:47,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:45:47" (1/1) ... [2019-09-08 04:45:47,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:45:47" (1/1) ... [2019-09-08 04:45:47,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:45:47" (1/1) ... [2019-09-08 04:45:47,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:45:47,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:45:47,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:45:47,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:45:47,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:45:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:45:47,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:45:47,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:45:47,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:45:47,664 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:45:47,664 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 04:45:47,664 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 04:45:47,664 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AutoResponder [2019-09-08 04:45:47,665 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-08 04:45:47,665 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 04:45:47,665 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 04:45:47,665 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 04:45:47,665 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 04:45:47,665 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 04:45:47,666 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:45:47,666 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:45:47,666 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:45:47,666 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:45:47,666 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:45:47,667 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:45:47,667 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:45:47,667 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:45:47,667 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:45:47,668 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:45:47,668 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:45:47,668 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 04:45:47,668 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 04:45:47,668 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-08 04:45:47,668 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 04:45:47,668 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 04:45:47,669 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 04:45:47,669 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 04:45:47,669 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-08 04:45:47,669 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 04:45:47,669 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 04:45:47,669 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 04:45:47,670 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 04:45:47,670 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 04:45:47,670 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 04:45:47,670 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 04:45:47,670 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 04:45:47,670 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 04:45:47,670 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 04:45:47,671 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 04:45:47,671 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 04:45:47,671 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 04:45:47,671 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 04:45:47,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-09-08 04:45:47,671 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 04:45:47,671 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 04:45:47,672 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 04:45:47,672 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 04:45:47,672 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 04:45:47,672 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 04:45:47,672 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 04:45:47,672 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 04:45:47,672 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 04:45:47,673 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 04:45:47,673 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 04:45:47,673 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 04:45:47,673 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 04:45:47,673 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 04:45:47,673 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 04:45:47,673 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 04:45:47,674 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 04:45:47,674 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 04:45:47,674 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 04:45:47,674 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 04:45:47,674 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 04:45:47,674 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 04:45:47,675 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 04:45:47,675 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 04:45:47,675 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 04:45:47,675 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 04:45:47,675 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 04:45:47,675 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 04:45:47,675 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 04:45:47,676 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 04:45:47,676 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 04:45:47,676 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 04:45:47,676 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 04:45:47,676 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 04:45:47,676 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 04:45:47,677 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 04:45:47,677 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 04:45:47,677 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:45:47,677 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:45:47,677 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 04:45:47,677 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 04:45:47,677 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 04:45:47,678 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 04:45:47,678 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 04:45:47,678 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 04:45:47,678 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 04:45:47,678 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 04:45:47,678 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 04:45:47,678 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 04:45:47,679 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 04:45:47,679 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 04:45:47,679 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 04:45:47,679 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 04:45:47,679 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 04:45:47,679 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 04:45:47,679 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 04:45:47,680 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 04:45:47,680 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 04:45:47,680 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 04:45:47,680 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 04:45:47,680 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 04:45:47,680 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 04:45:47,680 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 04:45:47,681 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 04:45:47,681 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 04:45:47,681 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 04:45:47,681 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 04:45:47,681 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 04:45:47,681 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 04:45:47,682 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 04:45:47,682 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 04:45:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:45:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:45:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:45:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:45:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 04:45:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:45:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 04:45:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 04:45:47,684 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 04:45:47,684 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 04:45:47,684 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 04:45:47,684 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 04:45:47,684 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 04:45:47,684 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 04:45:47,685 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 04:45:47,685 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 04:45:47,685 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 04:45:47,685 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 04:45:47,685 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 04:45:47,686 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 04:45:47,686 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 04:45:47,686 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AutoResponder [2019-09-08 04:45:47,686 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-08 04:45:47,686 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 04:45:47,687 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:45:47,687 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:45:47,687 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:45:47,687 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:45:47,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:45:47,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:45:47,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:45:47,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:45:47,688 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:45:47,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:45:47,688 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:45:47,689 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:45:47,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:45:47,689 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:45:47,689 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:45:47,689 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:45:47,689 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 04:45:47,690 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 04:45:47,690 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 04:45:47,690 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 04:45:47,690 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 04:45:47,690 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 04:45:47,690 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 04:45:47,690 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 04:45:47,691 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 04:45:47,691 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 04:45:47,691 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:45:47,691 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:45:47,691 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:45:47,691 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:45:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:45:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 04:45:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 04:45:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 04:45:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 04:45:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 04:45:47,693 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 04:45:47,693 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 04:45:47,693 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 04:45:47,693 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 04:45:47,693 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 04:45:47,693 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 04:45:47,694 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 04:45:47,694 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 04:45:47,694 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 04:45:47,694 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 04:45:47,694 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 04:45:47,694 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 04:45:47,695 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 04:45:47,695 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 04:45:47,695 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 04:45:47,695 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 04:45:47,695 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 04:45:47,695 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 04:45:47,696 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 04:45:47,696 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 04:45:47,696 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 04:45:47,696 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 04:45:47,696 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 04:45:47,697 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 04:45:47,697 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-09-08 04:45:47,697 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 04:45:47,697 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-08 04:45:47,697 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 04:45:47,697 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 04:45:47,698 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-08 04:45:47,698 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 04:45:47,698 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 04:45:47,698 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 04:45:47,698 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 04:45:47,698 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 04:45:47,699 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 04:45:47,699 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 04:45:47,699 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 04:45:47,699 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 04:45:47,699 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 04:45:47,699 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 04:45:47,700 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 04:45:47,700 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 04:45:47,700 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 04:45:47,700 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 04:45:47,700 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 04:45:47,700 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 04:45:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 04:45:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 04:45:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 04:45:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 04:45:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 04:45:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 04:45:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 04:45:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 04:45:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 04:45:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 04:45:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:45:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:45:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 04:45:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 04:45:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 04:45:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 04:45:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 04:45:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 04:45:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 04:45:47,704 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 04:45:47,704 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 04:45:47,704 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 04:45:47,704 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 04:45:47,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:45:47,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:45:47,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:45:49,958 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:45:49,958 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 04:45:49,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:45:49 BoogieIcfgContainer [2019-09-08 04:45:49,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:45:49,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:45:49,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:45:49,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:45:49,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:45:46" (1/3) ... [2019-09-08 04:45:49,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9fdcbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:45:49, skipping insertion in model container [2019-09-08 04:45:49,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:45:47" (2/3) ... [2019-09-08 04:45:49,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9fdcbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:45:49, skipping insertion in model container [2019-09-08 04:45:49,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:45:49" (3/3) ... [2019-09-08 04:45:49,970 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec1_product33.cil.c [2019-09-08 04:45:49,980 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:45:49,992 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:45:50,009 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:45:50,057 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:45:50,061 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:45:50,061 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:45:50,061 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:45:50,061 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:45:50,061 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:45:50,062 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:45:50,062 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:45:50,062 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:45:50,107 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states. [2019-09-08 04:45:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 04:45:50,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:45:50,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:45:50,154 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:45:50,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:45:50,163 INFO L82 PathProgramCache]: Analyzing trace with hash 855060391, now seen corresponding path program 1 times [2019-09-08 04:45:50,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:45:50,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:45:50,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:50,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:45:50,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:45:50,772 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:45:50,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:45:50,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 04:45:50,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 04:45:50,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 04:45:50,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:45:50,839 INFO L87 Difference]: Start difference. First operand 590 states. Second operand 2 states. [2019-09-08 04:45:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:45:50,937 INFO L93 Difference]: Finished difference Result 911 states and 1196 transitions. [2019-09-08 04:45:50,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 04:45:50,939 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 158 [2019-09-08 04:45:50,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:45:50,975 INFO L225 Difference]: With dead ends: 911 [2019-09-08 04:45:50,975 INFO L226 Difference]: Without dead ends: 567 [2019-09-08 04:45:50,988 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:45:51,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-08 04:45:51,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2019-09-08 04:45:51,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-09-08 04:45:51,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 749 transitions. [2019-09-08 04:45:51,118 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 749 transitions. Word has length 158 [2019-09-08 04:45:51,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:45:51,120 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 749 transitions. [2019-09-08 04:45:51,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 04:45:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 749 transitions. [2019-09-08 04:45:51,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 04:45:51,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:45:51,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:45:51,126 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:45:51,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:45:51,126 INFO L82 PathProgramCache]: Analyzing trace with hash -66196826, now seen corresponding path program 1 times [2019-09-08 04:45:51,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:45:51,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:45:51,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:51,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:45:51,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:45:51,381 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:45:51,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:45:51,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:45:51,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:45:51,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:45:51,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:45:51,385 INFO L87 Difference]: Start difference. First operand 567 states and 749 transitions. Second operand 3 states. [2019-09-08 04:45:51,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:45:51,432 INFO L93 Difference]: Finished difference Result 894 states and 1164 transitions. [2019-09-08 04:45:51,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:45:51,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-09-08 04:45:51,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:45:51,438 INFO L225 Difference]: With dead ends: 894 [2019-09-08 04:45:51,438 INFO L226 Difference]: Without dead ends: 570 [2019-09-08 04:45:51,440 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:45:51,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-09-08 04:45:51,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 569. [2019-09-08 04:45:51,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-09-08 04:45:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 751 transitions. [2019-09-08 04:45:51,470 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 751 transitions. Word has length 159 [2019-09-08 04:45:51,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:45:51,470 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 751 transitions. [2019-09-08 04:45:51,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:45:51,471 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 751 transitions. [2019-09-08 04:45:51,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 04:45:51,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:45:51,474 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, 1, 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:45:51,474 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:45:51,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:45:51,475 INFO L82 PathProgramCache]: Analyzing trace with hash -868266921, now seen corresponding path program 1 times [2019-09-08 04:45:51,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:45:51,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:45:51,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:51,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:45:51,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:45:51,626 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:45:51,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:45:51,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:45:51,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:45:51,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:45:51,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:45:51,632 INFO L87 Difference]: Start difference. First operand 569 states and 751 transitions. Second operand 3 states. [2019-09-08 04:45:51,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:45:51,684 INFO L93 Difference]: Finished difference Result 1116 states and 1503 transitions. [2019-09-08 04:45:51,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:45:51,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-08 04:45:51,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:45:51,727 INFO L225 Difference]: With dead ends: 1116 [2019-09-08 04:45:51,727 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 04:45:51,730 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:45:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 04:45:51,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 611. [2019-09-08 04:45:51,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 04:45:51,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 823 transitions. [2019-09-08 04:45:51,771 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 823 transitions. Word has length 171 [2019-09-08 04:45:51,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:45:51,772 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 823 transitions. [2019-09-08 04:45:51,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:45:51,772 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 823 transitions. [2019-09-08 04:45:51,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 04:45:51,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:45:51,776 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, 1, 1, 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:45:51,779 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:45:51,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:45:51,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1221959654, now seen corresponding path program 1 times [2019-09-08 04:45:51,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:45:51,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:45:51,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:51,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:45:51,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:45:51,946 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:45:51,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:45:51,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:45:51,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:45:51,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:45:51,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:45:51,950 INFO L87 Difference]: Start difference. First operand 611 states and 823 transitions. Second operand 3 states. [2019-09-08 04:45:51,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:45:51,996 INFO L93 Difference]: Finished difference Result 1239 states and 1714 transitions. [2019-09-08 04:45:51,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:45:51,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-08 04:45:51,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:45:52,005 INFO L225 Difference]: With dead ends: 1239 [2019-09-08 04:45:52,005 INFO L226 Difference]: Without dead ends: 693 [2019-09-08 04:45:52,007 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:45:52,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2019-09-08 04:45:52,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 692. [2019-09-08 04:45:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-09-08 04:45:52,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 961 transitions. [2019-09-08 04:45:52,044 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 961 transitions. Word has length 172 [2019-09-08 04:45:52,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:45:52,045 INFO L475 AbstractCegarLoop]: Abstraction has 692 states and 961 transitions. [2019-09-08 04:45:52,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:45:52,045 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 961 transitions. [2019-09-08 04:45:52,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 04:45:52,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:45:52,053 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, 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:45:52,053 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:45:52,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:45:52,053 INFO L82 PathProgramCache]: Analyzing trace with hash 946259743, now seen corresponding path program 1 times [2019-09-08 04:45:52,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:45:52,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:45:52,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:52,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:45:52,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:45:52,276 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:45:52,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:45:52,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:45:52,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:45:52,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:45:52,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:45:52,278 INFO L87 Difference]: Start difference. First operand 692 states and 961 transitions. Second operand 6 states. [2019-09-08 04:45:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:45:53,169 INFO L93 Difference]: Finished difference Result 1333 states and 1869 transitions. [2019-09-08 04:45:53,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:45:53,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2019-09-08 04:45:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:45:53,174 INFO L225 Difference]: With dead ends: 1333 [2019-09-08 04:45:53,175 INFO L226 Difference]: Without dead ends: 704 [2019-09-08 04:45:53,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:45:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-09-08 04:45:53,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2019-09-08 04:45:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-09-08 04:45:53,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 976 transitions. [2019-09-08 04:45:53,208 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 976 transitions. Word has length 175 [2019-09-08 04:45:53,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:45:53,209 INFO L475 AbstractCegarLoop]: Abstraction has 704 states and 976 transitions. [2019-09-08 04:45:53,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:45:53,209 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 976 transitions. [2019-09-08 04:45:53,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 04:45:53,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:45:53,214 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, 1, 1, 1, 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:45:53,214 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:45:53,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:45:53,214 INFO L82 PathProgramCache]: Analyzing trace with hash 905861719, now seen corresponding path program 1 times [2019-09-08 04:45:53,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:45:53,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:45:53,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:53,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:45:53,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:45:53,358 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:45:53,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:45:53,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:45:53,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:45:53,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:45:53,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:45:53,361 INFO L87 Difference]: Start difference. First operand 704 states and 976 transitions. Second operand 3 states. [2019-09-08 04:45:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:45:53,404 INFO L93 Difference]: Finished difference Result 1488 states and 2132 transitions. [2019-09-08 04:45:53,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:45:53,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-08 04:45:53,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:45:53,411 INFO L225 Difference]: With dead ends: 1488 [2019-09-08 04:45:53,412 INFO L226 Difference]: Without dead ends: 861 [2019-09-08 04:45:53,414 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:45:53,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-09-08 04:45:53,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 860. [2019-09-08 04:45:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2019-09-08 04:45:53,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1240 transitions. [2019-09-08 04:45:53,463 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1240 transitions. Word has length 173 [2019-09-08 04:45:53,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:45:53,465 INFO L475 AbstractCegarLoop]: Abstraction has 860 states and 1240 transitions. [2019-09-08 04:45:53,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:45:53,465 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1240 transitions. [2019-09-08 04:45:53,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 04:45:53,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:45:53,471 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, 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:45:53,471 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:45:53,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:45:53,471 INFO L82 PathProgramCache]: Analyzing trace with hash -885316278, now seen corresponding path program 1 times [2019-09-08 04:45:53,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:45:53,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:45:53,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:53,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:45:53,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:45:53,728 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:45:53,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:45:53,729 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:45:53,758 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:45:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:45:54,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 2736 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:45:54,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:45:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 04:45:54,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:45:54,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2019-09-08 04:45:54,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:45:54,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:45:54,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:45:54,649 INFO L87 Difference]: Start difference. First operand 860 states and 1240 transitions. Second operand 13 states. [2019-09-08 04:45:56,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:45:56,606 INFO L93 Difference]: Finished difference Result 1678 states and 2440 transitions. [2019-09-08 04:45:56,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:45:56,609 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 176 [2019-09-08 04:45:56,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:45:56,615 INFO L225 Difference]: With dead ends: 1678 [2019-09-08 04:45:56,616 INFO L226 Difference]: Without dead ends: 866 [2019-09-08 04:45:56,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 172 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:45:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2019-09-08 04:45:56,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 864. [2019-09-08 04:45:56,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-09-08 04:45:56,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1245 transitions. [2019-09-08 04:45:56,663 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1245 transitions. Word has length 176 [2019-09-08 04:45:56,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:45:56,664 INFO L475 AbstractCegarLoop]: Abstraction has 864 states and 1245 transitions. [2019-09-08 04:45:56,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:45:56,664 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1245 transitions. [2019-09-08 04:45:56,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 04:45:56,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:45:56,670 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:45:56,670 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:45:56,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:45:56,671 INFO L82 PathProgramCache]: Analyzing trace with hash 526361765, now seen corresponding path program 1 times [2019-09-08 04:45:56,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:45:56,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:45:56,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:56,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:45:56,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:45:56,880 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:45:56,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:45:56,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:45:56,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:45:56,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:45:56,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:45:56,882 INFO L87 Difference]: Start difference. First operand 864 states and 1245 transitions. Second operand 7 states. [2019-09-08 04:45:57,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:45:57,204 INFO L93 Difference]: Finished difference Result 1676 states and 2427 transitions. [2019-09-08 04:45:57,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:45:57,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 178 [2019-09-08 04:45:57,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:45:57,213 INFO L225 Difference]: With dead ends: 1676 [2019-09-08 04:45:57,214 INFO L226 Difference]: Without dead ends: 878 [2019-09-08 04:45:57,217 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:45:57,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2019-09-08 04:45:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 874. [2019-09-08 04:45:57,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2019-09-08 04:45:57,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1256 transitions. [2019-09-08 04:45:57,269 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1256 transitions. Word has length 178 [2019-09-08 04:45:57,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:45:57,270 INFO L475 AbstractCegarLoop]: Abstraction has 874 states and 1256 transitions. [2019-09-08 04:45:57,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:45:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1256 transitions. [2019-09-08 04:45:57,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 04:45:57,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:45:57,276 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, 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:45:57,276 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:45:57,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:45:57,276 INFO L82 PathProgramCache]: Analyzing trace with hash -2101643189, now seen corresponding path program 2 times [2019-09-08 04:45:57,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:45:57,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:45:57,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:57,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:45:57,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:45:57,563 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 04:45:57,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:45:57,564 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:45:57,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:45:58,230 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 04:45:58,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 04:45:58,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 2739 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 04:45:58,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:45:58,488 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-08 04:45:58,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:45:58,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2019-09-08 04:45:58,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 04:45:58,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 04:45:58,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:45:58,516 INFO L87 Difference]: Start difference. First operand 874 states and 1256 transitions. Second operand 15 states. [2019-09-08 04:46:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:46:11,733 INFO L93 Difference]: Finished difference Result 3333 states and 4907 transitions. [2019-09-08 04:46:11,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 04:46:11,733 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 179 [2019-09-08 04:46:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:46:11,751 INFO L225 Difference]: With dead ends: 3333 [2019-09-08 04:46:11,752 INFO L226 Difference]: Without dead ends: 2537 [2019-09-08 04:46:11,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=392, Invalid=2058, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 04:46:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2019-09-08 04:46:11,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2525. [2019-09-08 04:46:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2525 states. [2019-09-08 04:46:11,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2525 states and 3723 transitions. [2019-09-08 04:46:11,896 INFO L78 Accepts]: Start accepts. Automaton has 2525 states and 3723 transitions. Word has length 179 [2019-09-08 04:46:11,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:46:11,897 INFO L475 AbstractCegarLoop]: Abstraction has 2525 states and 3723 transitions. [2019-09-08 04:46:11,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 04:46:11,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2525 states and 3723 transitions. [2019-09-08 04:46:11,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 04:46:11,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:46:11,908 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, 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:11,909 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:46:11,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:46:11,909 INFO L82 PathProgramCache]: Analyzing trace with hash -680675490, now seen corresponding path program 1 times [2019-09-08 04:46:11,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:46:11,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:46:11,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:11,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 04:46:11,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:12,096 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 04:46:12,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:46:12,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:46:12,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:46:12,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:46:12,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:46:12,098 INFO L87 Difference]: Start difference. First operand 2525 states and 3723 transitions. Second operand 11 states. [2019-09-08 04:46:12,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:46:12,549 INFO L93 Difference]: Finished difference Result 3214 states and 4606 transitions. [2019-09-08 04:46:12,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:46:12,550 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 181 [2019-09-08 04:46:12,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:46:12,570 INFO L225 Difference]: With dead ends: 3214 [2019-09-08 04:46:12,571 INFO L226 Difference]: Without dead ends: 2245 [2019-09-08 04:46:12,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:46:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2019-09-08 04:46:12,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2243. [2019-09-08 04:46:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2019-09-08 04:46:12,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 3359 transitions. [2019-09-08 04:46:12,731 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 3359 transitions. Word has length 181 [2019-09-08 04:46:12,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:46:12,732 INFO L475 AbstractCegarLoop]: Abstraction has 2243 states and 3359 transitions. [2019-09-08 04:46:12,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:46:12,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 3359 transitions. [2019-09-08 04:46:12,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 04:46:12,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:46:12,746 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:46:12,746 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:46:12,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:46:12,747 INFO L82 PathProgramCache]: Analyzing trace with hash -861444978, now seen corresponding path program 1 times [2019-09-08 04:46:12,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:46:12,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:46:12,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:12,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:46:12,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:46:12,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:46:12,928 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:46:12,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:46:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:13,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 2741 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 04:46:13,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:46:13,491 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 04:46:13,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:46:13,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-08 04:46:13,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:46:13,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:46:13,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:46:13,509 INFO L87 Difference]: Start difference. First operand 2243 states and 3359 transitions. Second operand 12 states. [2019-09-08 04:46:15,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:46:15,437 INFO L93 Difference]: Finished difference Result 3400 states and 4999 transitions. [2019-09-08 04:46:15,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:46:15,438 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 181 [2019-09-08 04:46:15,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:46:15,448 INFO L225 Difference]: With dead ends: 3400 [2019-09-08 04:46:15,449 INFO L226 Difference]: Without dead ends: 1716 [2019-09-08 04:46:15,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:46:15,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2019-09-08 04:46:15,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1708. [2019-09-08 04:46:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1708 states. [2019-09-08 04:46:15,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2506 transitions. [2019-09-08 04:46:15,532 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2506 transitions. Word has length 181 [2019-09-08 04:46:15,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:46:15,533 INFO L475 AbstractCegarLoop]: Abstraction has 1708 states and 2506 transitions. [2019-09-08 04:46:15,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:46:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2506 transitions. [2019-09-08 04:46:15,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 04:46:15,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:46:15,540 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, 1, 1, 1, 1, 1, 1, 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:15,541 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:46:15,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:46:15,541 INFO L82 PathProgramCache]: Analyzing trace with hash -581720906, now seen corresponding path program 1 times [2019-09-08 04:46:15,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:46:15,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:46:15,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:15,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:46:15,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:15,729 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:46:15,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:46:15,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:46:15,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:46:15,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:46:15,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:46:15,731 INFO L87 Difference]: Start difference. First operand 1708 states and 2506 transitions. Second operand 9 states. [2019-09-08 04:46:16,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:46:16,053 INFO L93 Difference]: Finished difference Result 3345 states and 4931 transitions. [2019-09-08 04:46:16,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:46:16,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 190 [2019-09-08 04:46:16,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:46:16,065 INFO L225 Difference]: With dead ends: 3345 [2019-09-08 04:46:16,065 INFO L226 Difference]: Without dead ends: 1710 [2019-09-08 04:46:16,072 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:46:16,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2019-09-08 04:46:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1708. [2019-09-08 04:46:16,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1708 states. [2019-09-08 04:46:16,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2505 transitions. [2019-09-08 04:46:16,155 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2505 transitions. Word has length 190 [2019-09-08 04:46:16,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:46:16,155 INFO L475 AbstractCegarLoop]: Abstraction has 1708 states and 2505 transitions. [2019-09-08 04:46:16,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:46:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2505 transitions. [2019-09-08 04:46:16,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 04:46:16,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:46:16,163 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,164 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:46:16,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:46:16,164 INFO L82 PathProgramCache]: Analyzing trace with hash 437006339, now seen corresponding path program 2 times [2019-09-08 04:46:16,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:46:16,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:46:16,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:16,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:46:16,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:16,385 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:46:16,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:46:16,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:46:16,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:46:16,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:46:16,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:46:16,387 INFO L87 Difference]: Start difference. First operand 1708 states and 2505 transitions. Second operand 9 states. [2019-09-08 04:46:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:46:16,720 INFO L93 Difference]: Finished difference Result 3347 states and 4932 transitions. [2019-09-08 04:46:16,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:46:16,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2019-09-08 04:46:16,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:46:16,733 INFO L225 Difference]: With dead ends: 3347 [2019-09-08 04:46:16,733 INFO L226 Difference]: Without dead ends: 1712 [2019-09-08 04:46:16,740 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:46:16,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2019-09-08 04:46:16,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1708. [2019-09-08 04:46:16,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1708 states. [2019-09-08 04:46:16,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2504 transitions. [2019-09-08 04:46:16,835 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2504 transitions. Word has length 191 [2019-09-08 04:46:16,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:46:16,835 INFO L475 AbstractCegarLoop]: Abstraction has 1708 states and 2504 transitions. [2019-09-08 04:46:16,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:46:16,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2504 transitions. [2019-09-08 04:46:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 04:46:16,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:46:16,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,844 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:46:16,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:46:16,845 INFO L82 PathProgramCache]: Analyzing trace with hash 25407281, now seen corresponding path program 1 times [2019-09-08 04:46:16,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:46:16,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:46:16,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:16,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 04:46:16,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:17,370 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:46:17,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:46:17,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 04:46:17,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 04:46:17,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 04:46:17,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:46:17,375 INFO L87 Difference]: Start difference. First operand 1708 states and 2504 transitions. Second operand 18 states. [2019-09-08 04:46:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:46:22,653 INFO L93 Difference]: Finished difference Result 4691 states and 6775 transitions. [2019-09-08 04:46:22,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 04:46:22,654 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 192 [2019-09-08 04:46:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:46:22,680 INFO L225 Difference]: With dead ends: 4691 [2019-09-08 04:46:22,680 INFO L226 Difference]: Without dead ends: 4054 [2019-09-08 04:46:22,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1549, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 04:46:22,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4054 states. [2019-09-08 04:46:22,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4054 to 4014. [2019-09-08 04:46:22,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4014 states. [2019-09-08 04:46:22,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4014 states to 4014 states and 5904 transitions. [2019-09-08 04:46:22,866 INFO L78 Accepts]: Start accepts. Automaton has 4014 states and 5904 transitions. Word has length 192 [2019-09-08 04:46:22,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:46:22,866 INFO L475 AbstractCegarLoop]: Abstraction has 4014 states and 5904 transitions. [2019-09-08 04:46:22,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 04:46:22,867 INFO L276 IsEmpty]: Start isEmpty. Operand 4014 states and 5904 transitions. [2019-09-08 04:46:22,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 04:46:22,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:46:22,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,882 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:46:22,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:46:22,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1808631052, now seen corresponding path program 1 times [2019-09-08 04:46:22,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:46:22,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:46:22,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:22,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:46:22,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:23,016 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:46:23,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:46:23,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:46:23,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:46:23,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:46:23,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:46:23,018 INFO L87 Difference]: Start difference. First operand 4014 states and 5904 transitions. Second operand 5 states. [2019-09-08 04:46:23,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:46:23,147 INFO L93 Difference]: Finished difference Result 5319 states and 7570 transitions. [2019-09-08 04:46:23,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:46:23,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2019-09-08 04:46:23,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:46:23,176 INFO L225 Difference]: With dead ends: 5319 [2019-09-08 04:46:23,176 INFO L226 Difference]: Without dead ends: 3828 [2019-09-08 04:46:23,186 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:46:23,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2019-09-08 04:46:23,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 3800. [2019-09-08 04:46:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3800 states. [2019-09-08 04:46:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3800 states to 3800 states and 5582 transitions. [2019-09-08 04:46:23,368 INFO L78 Accepts]: Start accepts. Automaton has 3800 states and 5582 transitions. Word has length 193 [2019-09-08 04:46:23,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:46:23,369 INFO L475 AbstractCegarLoop]: Abstraction has 3800 states and 5582 transitions. [2019-09-08 04:46:23,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:46:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3800 states and 5582 transitions. [2019-09-08 04:46:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 04:46:23,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:46:23,381 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,382 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:46:23,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:46:23,382 INFO L82 PathProgramCache]: Analyzing trace with hash 808327389, now seen corresponding path program 1 times [2019-09-08 04:46:23,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:46:23,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:46:23,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:23,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:46:23,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:23,569 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:46:23,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:46:23,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:46:23,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:46:23,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:46:23,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:46:23,571 INFO L87 Difference]: Start difference. First operand 3800 states and 5582 transitions. Second operand 11 states. [2019-09-08 04:46:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:46:23,981 INFO L93 Difference]: Finished difference Result 5613 states and 7913 transitions. [2019-09-08 04:46:23,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:46:23,982 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 193 [2019-09-08 04:46:23,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:46:24,025 INFO L225 Difference]: With dead ends: 5613 [2019-09-08 04:46:24,025 INFO L226 Difference]: Without dead ends: 3852 [2019-09-08 04:46:24,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:46:24,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3852 states. [2019-09-08 04:46:24,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3852 to 3848. [2019-09-08 04:46:24,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2019-09-08 04:46:24,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5662 transitions. [2019-09-08 04:46:24,259 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5662 transitions. Word has length 193 [2019-09-08 04:46:24,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:46:24,260 INFO L475 AbstractCegarLoop]: Abstraction has 3848 states and 5662 transitions. [2019-09-08 04:46:24,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:46:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5662 transitions. [2019-09-08 04:46:24,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 04:46:24,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:46:24,276 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,277 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:46:24,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:46:24,277 INFO L82 PathProgramCache]: Analyzing trace with hash -640271601, now seen corresponding path program 1 times [2019-09-08 04:46:24,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:46:24,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:46:24,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:24,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:46:24,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:24,538 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:46:24,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:46:24,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:46:24,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:46:24,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:46:24,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:46:24,540 INFO L87 Difference]: Start difference. First operand 3848 states and 5662 transitions. Second operand 5 states. [2019-09-08 04:46:25,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:46:25,887 INFO L93 Difference]: Finished difference Result 8894 states and 12685 transitions. [2019-09-08 04:46:25,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:46:25,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2019-09-08 04:46:25,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:46:25,935 INFO L225 Difference]: With dead ends: 8894 [2019-09-08 04:46:25,935 INFO L226 Difference]: Without dead ends: 7767 [2019-09-08 04:46:25,946 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:46:25,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7767 states. [2019-09-08 04:46:26,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7767 to 7717. [2019-09-08 04:46:26,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7717 states. [2019-09-08 04:46:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7717 states to 7717 states and 11152 transitions. [2019-09-08 04:46:26,323 INFO L78 Accepts]: Start accepts. Automaton has 7717 states and 11152 transitions. Word has length 193 [2019-09-08 04:46:26,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:46:26,324 INFO L475 AbstractCegarLoop]: Abstraction has 7717 states and 11152 transitions. [2019-09-08 04:46:26,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:46:26,324 INFO L276 IsEmpty]: Start isEmpty. Operand 7717 states and 11152 transitions. [2019-09-08 04:46:26,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 04:46:26,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:46:26,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,343 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:46:26,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:46:26,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1644591854, now seen corresponding path program 1 times [2019-09-08 04:46:26,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:46:26,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:46:26,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:26,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:46:26,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:26,515 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:46:26,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:46:26,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:46:26,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:46:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:27,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 2785 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:46:27,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:46:27,087 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:46:27,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:46:27,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 04:46:27,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:46:27,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:46:27,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:46:27,096 INFO L87 Difference]: Start difference. First operand 7717 states and 11152 transitions. Second operand 5 states. [2019-09-08 04:46:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:46:27,337 INFO L93 Difference]: Finished difference Result 10792 states and 15128 transitions. [2019-09-08 04:46:27,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:46:27,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2019-09-08 04:46:27,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:46:27,376 INFO L225 Difference]: With dead ends: 10792 [2019-09-08 04:46:27,376 INFO L226 Difference]: Without dead ends: 7800 [2019-09-08 04:46:27,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 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:46:27,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7800 states. [2019-09-08 04:46:27,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7800 to 7790. [2019-09-08 04:46:27,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7790 states. [2019-09-08 04:46:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7790 states to 7790 states and 11266 transitions. [2019-09-08 04:46:27,754 INFO L78 Accepts]: Start accepts. Automaton has 7790 states and 11266 transitions. Word has length 193 [2019-09-08 04:46:27,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:46:27,754 INFO L475 AbstractCegarLoop]: Abstraction has 7790 states and 11266 transitions. [2019-09-08 04:46:27,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:46:27,754 INFO L276 IsEmpty]: Start isEmpty. Operand 7790 states and 11266 transitions. [2019-09-08 04:46:27,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 04:46:27,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:46:27,776 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:46:27,776 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:46:27,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:46:27,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1034171042, now seen corresponding path program 1 times [2019-09-08 04:46:27,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:46:27,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:46:27,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:27,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:46:27,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:27,900 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:46:27,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:46:27,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:46:27,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:46:27,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:46:27,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:46:27,902 INFO L87 Difference]: Start difference. First operand 7790 states and 11266 transitions. Second operand 3 states. [2019-09-08 04:46:28,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:46:28,140 INFO L93 Difference]: Finished difference Result 17274 states and 25740 transitions. [2019-09-08 04:46:28,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:46:28,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2019-09-08 04:46:28,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:46:28,186 INFO L225 Difference]: With dead ends: 17274 [2019-09-08 04:46:28,186 INFO L226 Difference]: Without dead ends: 9602 [2019-09-08 04:46:28,221 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:46:28,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9602 states. [2019-09-08 04:46:28,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9602 to 9596. [2019-09-08 04:46:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9596 states. [2019-09-08 04:46:28,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9596 states to 9596 states and 14559 transitions. [2019-09-08 04:46:28,873 INFO L78 Accepts]: Start accepts. Automaton has 9596 states and 14559 transitions. Word has length 191 [2019-09-08 04:46:28,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:46:28,873 INFO L475 AbstractCegarLoop]: Abstraction has 9596 states and 14559 transitions. [2019-09-08 04:46:28,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:46:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand 9596 states and 14559 transitions. [2019-09-08 04:46:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 04:46:28,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:46:28,900 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:46:28,900 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:46:28,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:46:28,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1794682263, now seen corresponding path program 1 times [2019-09-08 04:46:28,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:46:28,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:46:28,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:28,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:46:28,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:29,020 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:46:29,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:46:29,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:46:29,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:46:29,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:46:29,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:46:29,022 INFO L87 Difference]: Start difference. First operand 9596 states and 14559 transitions. Second operand 3 states. [2019-09-08 04:46:29,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:46:29,281 INFO L93 Difference]: Finished difference Result 22530 states and 35310 transitions. [2019-09-08 04:46:29,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:46:29,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-09-08 04:46:29,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:46:29,331 INFO L225 Difference]: With dead ends: 22530 [2019-09-08 04:46:29,331 INFO L226 Difference]: Without dead ends: 13064 [2019-09-08 04:46:29,369 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:46:29,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13064 states. [2019-09-08 04:46:30,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13064 to 13058. [2019-09-08 04:46:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13058 states. [2019-09-08 04:46:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13058 states to 13058 states and 20804 transitions. [2019-09-08 04:46:30,756 INFO L78 Accepts]: Start accepts. Automaton has 13058 states and 20804 transitions. Word has length 192 [2019-09-08 04:46:30,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:46:30,757 INFO L475 AbstractCegarLoop]: Abstraction has 13058 states and 20804 transitions. [2019-09-08 04:46:30,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:46:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 13058 states and 20804 transitions. [2019-09-08 04:46:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 04:46:30,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:46:30,779 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:46:30,780 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:46:30,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:46:30,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1169476126, now seen corresponding path program 1 times [2019-09-08 04:46:30,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:46:30,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:46:30,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:30,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:46:30,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:30,955 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:46:30,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:46:30,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:46:30,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:46:30,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:46:30,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:46:30,958 INFO L87 Difference]: Start difference. First operand 13058 states and 20804 transitions. Second operand 3 states. [2019-09-08 04:46:31,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:46:31,401 INFO L93 Difference]: Finished difference Result 32608 states and 53640 transitions. [2019-09-08 04:46:31,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:46:31,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-09-08 04:46:31,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:46:31,489 INFO L225 Difference]: With dead ends: 32608 [2019-09-08 04:46:31,489 INFO L226 Difference]: Without dead ends: 19690 [2019-09-08 04:46:31,526 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:46:31,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19690 states. [2019-09-08 04:46:32,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19690 to 19684. [2019-09-08 04:46:32,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19684 states. [2019-09-08 04:46:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19684 states to 19684 states and 32805 transitions. [2019-09-08 04:46:32,635 INFO L78 Accepts]: Start accepts. Automaton has 19684 states and 32805 transitions. Word has length 193 [2019-09-08 04:46:32,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:46:32,635 INFO L475 AbstractCegarLoop]: Abstraction has 19684 states and 32805 transitions. [2019-09-08 04:46:32,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:46:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 19684 states and 32805 transitions. [2019-09-08 04:46:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-08 04:46:32,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:46:32,677 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:46:32,677 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:46:32,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:46:32,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1383732439, now seen corresponding path program 1 times [2019-09-08 04:46:32,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:46:32,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:46:32,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:32,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:46:32,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:32,810 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:46:32,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:46:32,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:46:32,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:46:32,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:46:32,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:46:32,812 INFO L87 Difference]: Start difference. First operand 19684 states and 32805 transitions. Second operand 3 states. [2019-09-08 04:46:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:46:33,819 INFO L93 Difference]: Finished difference Result 51903 states and 88290 transitions. [2019-09-08 04:46:33,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:46:33,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-09-08 04:46:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:46:33,943 INFO L225 Difference]: With dead ends: 51903 [2019-09-08 04:46:33,943 INFO L226 Difference]: Without dead ends: 32366 [2019-09-08 04:46:34,008 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:46:34,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32366 states. [2019-09-08 04:46:36,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32366 to 32360. [2019-09-08 04:46:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32360 states. [2019-09-08 04:46:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32360 states to 32360 states and 55272 transitions. [2019-09-08 04:46:36,625 INFO L78 Accepts]: Start accepts. Automaton has 32360 states and 55272 transitions. Word has length 194 [2019-09-08 04:46:36,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:46:36,626 INFO L475 AbstractCegarLoop]: Abstraction has 32360 states and 55272 transitions. [2019-09-08 04:46:36,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:46:36,626 INFO L276 IsEmpty]: Start isEmpty. Operand 32360 states and 55272 transitions. [2019-09-08 04:46:36,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 04:46:36,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:46:36,703 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:46:36,703 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:46:36,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:46:36,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1176239838, now seen corresponding path program 1 times [2019-09-08 04:46:36,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:46:36,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:46:36,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:36,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:46:36,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:36,845 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:46:36,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:46:36,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:46:36,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:46:36,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:46:36,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:46:36,848 INFO L87 Difference]: Start difference. First operand 32360 states and 55272 transitions. Second operand 3 states. [2019-09-08 04:46:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:46:38,966 INFO L93 Difference]: Finished difference Result 90303 states and 156447 transitions. [2019-09-08 04:46:38,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:46:38,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-09-08 04:46:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:46:39,142 INFO L225 Difference]: With dead ends: 90303 [2019-09-08 04:46:39,143 INFO L226 Difference]: Without dead ends: 58096 [2019-09-08 04:46:39,212 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:46:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58096 states. [2019-09-08 04:46:42,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58096 to 58090. [2019-09-08 04:46:42,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58090 states. [2019-09-08 04:46:42,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58090 states to 58090 states and 100585 transitions. [2019-09-08 04:46:42,907 INFO L78 Accepts]: Start accepts. Automaton has 58090 states and 100585 transitions. Word has length 195 [2019-09-08 04:46:42,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:46:42,907 INFO L475 AbstractCegarLoop]: Abstraction has 58090 states and 100585 transitions. [2019-09-08 04:46:42,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:46:42,907 INFO L276 IsEmpty]: Start isEmpty. Operand 58090 states and 100585 transitions. [2019-09-08 04:46:43,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 04:46:43,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:46:43,038 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, 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:43,038 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:46:43,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:46:43,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1727480855, now seen corresponding path program 1 times [2019-09-08 04:46:43,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:46:43,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:46:43,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:43,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:46:43,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:43,183 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:46:43,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:46:43,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:46:43,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:46:43,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:46:43,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:46:43,185 INFO L87 Difference]: Start difference. First operand 58090 states and 100585 transitions. Second operand 3 states. [2019-09-08 04:46:47,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:46:47,868 INFO L93 Difference]: Finished difference Result 163647 states and 284697 transitions. [2019-09-08 04:46:47,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:46:47,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-09-08 04:46:47,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:46:48,203 INFO L225 Difference]: With dead ends: 163647 [2019-09-08 04:46:48,203 INFO L226 Difference]: Without dead ends: 105718 [2019-09-08 04:46:48,326 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:46:48,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105718 states. [2019-09-08 04:46:54,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105718 to 105712. [2019-09-08 04:46:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105712 states. [2019-09-08 04:46:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105712 states to 105712 states and 182766 transitions. [2019-09-08 04:46:54,932 INFO L78 Accepts]: Start accepts. Automaton has 105712 states and 182766 transitions. Word has length 196 [2019-09-08 04:46:54,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:46:54,932 INFO L475 AbstractCegarLoop]: Abstraction has 105712 states and 182766 transitions. [2019-09-08 04:46:54,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:46:54,933 INFO L276 IsEmpty]: Start isEmpty. Operand 105712 states and 182766 transitions. [2019-09-08 04:46:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-08 04:46:55,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:46:55,126 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, 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:55,127 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:46:55,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:46:55,127 INFO L82 PathProgramCache]: Analyzing trace with hash 504384736, now seen corresponding path program 1 times [2019-09-08 04:46:55,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:46:55,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:46:55,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:55,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:46:55,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:55,239 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:46:55,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:46:55,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:46:55,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:46:55,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:46:55,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:46:55,241 INFO L87 Difference]: Start difference. First operand 105712 states and 182766 transitions. Second operand 3 states. [2019-09-08 04:47:03,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:47:03,341 INFO L93 Difference]: Finished difference Result 301882 states and 521999 transitions. [2019-09-08 04:47:03,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:47:03,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-09-08 04:47:03,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:47:04,022 INFO L225 Difference]: With dead ends: 301882 [2019-09-08 04:47:04,022 INFO L226 Difference]: Without dead ends: 196344 [2019-09-08 04:47:04,215 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:47:04,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196344 states. [2019-09-08 04:47:16,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196344 to 196338. [2019-09-08 04:47:16,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196338 states. [2019-09-08 04:47:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196338 states to 196338 states and 336367 transitions. [2019-09-08 04:47:17,065 INFO L78 Accepts]: Start accepts. Automaton has 196338 states and 336367 transitions. Word has length 197 [2019-09-08 04:47:17,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:47:17,066 INFO L475 AbstractCegarLoop]: Abstraction has 196338 states and 336367 transitions. [2019-09-08 04:47:17,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:47:17,066 INFO L276 IsEmpty]: Start isEmpty. Operand 196338 states and 336367 transitions. [2019-09-08 04:47:17,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-08 04:47:17,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:47:17,302 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, 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:47:17,302 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:47:17,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:47:17,302 INFO L82 PathProgramCache]: Analyzing trace with hash -733977705, now seen corresponding path program 1 times [2019-09-08 04:47:17,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:47:17,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:47:17,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:47:17,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:47:17,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:47:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:47:17,406 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:47:17,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:47:17,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:47:17,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:47:17,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:47:17,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:47:17,407 INFO L87 Difference]: Start difference. First operand 196338 states and 336367 transitions. Second operand 3 states. [2019-09-08 04:47:30,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:47:30,895 INFO L93 Difference]: Finished difference Result 369548 states and 628565 transitions. [2019-09-08 04:47:30,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:47:30,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-09-08 04:47:30,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:47:32,356 INFO L225 Difference]: With dead ends: 369548 [2019-09-08 04:47:32,357 INFO L226 Difference]: Without dead ends: 364716 [2019-09-08 04:47:32,481 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:47:32,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364716 states. [2019-09-08 04:48:03,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364716 to 364710. [2019-09-08 04:48:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364710 states. [2019-09-08 04:48:05,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364710 states to 364710 states and 616191 transitions. [2019-09-08 04:48:05,311 INFO L78 Accepts]: Start accepts. Automaton has 364710 states and 616191 transitions. Word has length 198 [2019-09-08 04:48:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:48:05,311 INFO L475 AbstractCegarLoop]: Abstraction has 364710 states and 616191 transitions. [2019-09-08 04:48:05,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:48:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 364710 states and 616191 transitions. [2019-09-08 04:48:05,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 04:48:05,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:48:05,629 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, 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:48:05,629 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:48:05,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:48:05,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1268830560, now seen corresponding path program 1 times [2019-09-08 04:48:05,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:48:05,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:48:05,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:05,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:48:05,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:48:06,227 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:48:06,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:48:06,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:48:06,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:48:06,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:48:06,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:48:06,229 INFO L87 Difference]: Start difference. First operand 364710 states and 616191 transitions. Second operand 3 states. [2019-09-08 04:48:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:48:25,106 INFO L93 Difference]: Finished difference Result 369934 states and 622933 transitions. [2019-09-08 04:48:25,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:48:25,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-09-08 04:48:25,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:48:27,389 INFO L225 Difference]: With dead ends: 369934 [2019-09-08 04:48:27,390 INFO L226 Difference]: Without dead ends: 365244 [2019-09-08 04:48:27,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:48:27,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365244 states. [2019-09-08 04:48:56,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365244 to 364249. [2019-09-08 04:48:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364249 states. [2019-09-08 04:48:57,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364249 states to 364249 states and 615509 transitions. [2019-09-08 04:48:57,741 INFO L78 Accepts]: Start accepts. Automaton has 364249 states and 615509 transitions. Word has length 199 [2019-09-08 04:48:57,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:48:57,741 INFO L475 AbstractCegarLoop]: Abstraction has 364249 states and 615509 transitions. [2019-09-08 04:48:57,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:48:57,742 INFO L276 IsEmpty]: Start isEmpty. Operand 364249 states and 615509 transitions. [2019-09-08 04:49:00,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-09-08 04:49:00,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:49:00,194 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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, 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, 1] [2019-09-08 04:49:00,194 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:49:00,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:49:00,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1513015177, now seen corresponding path program 1 times [2019-09-08 04:49:00,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:49:00,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:49:00,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:00,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:49:00,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:49:00,493 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-08 04:49:00,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:49:00,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:49:00,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:49:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:49:01,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 3724 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:49:01,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:49:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-08 04:49:01,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:49:01,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-09-08 04:49:01,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:49:01,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:49:01,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:49:01,144 INFO L87 Difference]: Start difference. First operand 364249 states and 615509 transitions. Second operand 12 states. [2019-09-08 04:49:26,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:49:26,606 INFO L93 Difference]: Finished difference Result 378547 states and 634970 transitions. [2019-09-08 04:49:26,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 04:49:26,606 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 374 [2019-09-08 04:49:26,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:49:27,897 INFO L225 Difference]: With dead ends: 378547 [2019-09-08 04:49:27,898 INFO L226 Difference]: Without dead ends: 374088 [2019-09-08 04:49:28,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2019-09-08 04:49:28,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374088 states. [2019-09-08 04:50:06,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374088 to 373753. [2019-09-08 04:50:06,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373753 states. [2019-09-08 04:50:07,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373753 states to 373753 states and 628343 transitions. [2019-09-08 04:50:07,571 INFO L78 Accepts]: Start accepts. Automaton has 373753 states and 628343 transitions. Word has length 374 [2019-09-08 04:50:07,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:50:07,571 INFO L475 AbstractCegarLoop]: Abstraction has 373753 states and 628343 transitions. [2019-09-08 04:50:07,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:50:07,572 INFO L276 IsEmpty]: Start isEmpty. Operand 373753 states and 628343 transitions. [2019-09-08 04:50:10,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-09-08 04:50:10,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:50:10,489 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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:50:10,489 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:50:10,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:50:10,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1697167060, now seen corresponding path program 1 times [2019-09-08 04:50:10,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:50:10,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:50:10,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:50:10,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:50:10,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:50:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:50:10,703 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-09-08 04:50:10,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:50:10,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:50:10,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:50:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:50:11,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 3840 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 04:50:11,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:50:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:50:11,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:50:11,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2019-09-08 04:50:11,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:50:11,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:50:11,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:50:11,400 INFO L87 Difference]: Start difference. First operand 373753 states and 628343 transitions. Second operand 9 states. [2019-09-08 04:50:30,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:50:30,105 INFO L93 Difference]: Finished difference Result 397492 states and 663037 transitions. [2019-09-08 04:50:30,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:50:30,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 406 [2019-09-08 04:50:30,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:50:31,299 INFO L225 Difference]: With dead ends: 397492 [2019-09-08 04:50:31,299 INFO L226 Difference]: Without dead ends: 385245 [2019-09-08 04:50:31,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:50:31,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385245 states. [2019-09-08 04:51:03,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385245 to 383291. [2019-09-08 04:51:03,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383291 states. [2019-09-08 04:51:04,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383291 states to 383291 states and 643209 transitions. [2019-09-08 04:51:04,987 INFO L78 Accepts]: Start accepts. Automaton has 383291 states and 643209 transitions. Word has length 406 [2019-09-08 04:51:04,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:51:04,988 INFO L475 AbstractCegarLoop]: Abstraction has 383291 states and 643209 transitions. [2019-09-08 04:51:04,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:51:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand 383291 states and 643209 transitions. [2019-09-08 04:51:06,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-08 04:51:06,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:51:06,610 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 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] [2019-09-08 04:51:06,610 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:51:06,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:51:06,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1557809262, now seen corresponding path program 1 times [2019-09-08 04:51:06,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:51:06,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:51:06,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:51:06,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:51:06,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:51:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:51:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-08 04:51:06,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:51:06,838 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:51:06,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:51:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:51:07,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 3635 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-08 04:51:07,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:51:15,847 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:51:15,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:51:15,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [9] total 26 [2019-09-08 04:51:15,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 04:51:15,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 04:51:15,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2019-09-08 04:51:15,858 INFO L87 Difference]: Start difference. First operand 383291 states and 643209 transitions. Second operand 26 states. [2019-09-08 04:51:51,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:51:51,444 INFO L93 Difference]: Finished difference Result 394343 states and 658144 transitions. [2019-09-08 04:51:51,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-08 04:51:51,445 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 352 [2019-09-08 04:51:51,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:51:52,586 INFO L225 Difference]: With dead ends: 394343 [2019-09-08 04:51:52,587 INFO L226 Difference]: Without dead ends: 384297 [2019-09-08 04:51:52,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1964 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=605, Invalid=7405, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 04:51:52,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384297 states. [2019-09-08 04:52:25,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384297 to 382509. [2019-09-08 04:52:25,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382509 states. [2019-09-08 04:52:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382509 states to 382509 states and 642314 transitions. [2019-09-08 04:52:27,237 INFO L78 Accepts]: Start accepts. Automaton has 382509 states and 642314 transitions. Word has length 352 [2019-09-08 04:52:27,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:52:27,238 INFO L475 AbstractCegarLoop]: Abstraction has 382509 states and 642314 transitions. [2019-09-08 04:52:27,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 04:52:27,238 INFO L276 IsEmpty]: Start isEmpty. Operand 382509 states and 642314 transitions. [2019-09-08 04:52:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-09-08 04:52:28,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:52:28,903 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:52:28,903 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:52:28,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:52:28,903 INFO L82 PathProgramCache]: Analyzing trace with hash -534008872, now seen corresponding path program 1 times [2019-09-08 04:52:28,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:52:28,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:52:28,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:52:28,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:52:28,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:52:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:52:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-08 04:52:29,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:52:29,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:52:29,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:52:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:52:37,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 3715 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 04:52:37,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:52:37,590 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 69 proven. 4 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-08 04:52:37,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:52:37,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-09-08 04:52:37,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 04:52:37,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 04:52:37,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-09-08 04:52:37,601 INFO L87 Difference]: Start difference. First operand 382509 states and 642314 transitions. Second operand 22 states. [2019-09-08 04:52:52,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:52:52,827 INFO L93 Difference]: Finished difference Result 387280 states and 648735 transitions. [2019-09-08 04:52:52,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 04:52:52,827 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 374 [2019-09-08 04:52:52,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:52:53,968 INFO L225 Difference]: With dead ends: 387280 [2019-09-08 04:52:53,968 INFO L226 Difference]: Without dead ends: 382851 [2019-09-08 04:52:54,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2019-09-08 04:52:54,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382851 states. [2019-09-08 04:53:25,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382851 to 382229. [2019-09-08 04:53:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382229 states. [2019-09-08 04:53:26,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382229 states to 382229 states and 641844 transitions. [2019-09-08 04:53:26,589 INFO L78 Accepts]: Start accepts. Automaton has 382229 states and 641844 transitions. Word has length 374 [2019-09-08 04:53:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:53:26,590 INFO L475 AbstractCegarLoop]: Abstraction has 382229 states and 641844 transitions. [2019-09-08 04:53:26,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 04:53:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 382229 states and 641844 transitions. [2019-09-08 04:53:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-09-08 04:53:28,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:53:28,252 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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, 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, 1] [2019-09-08 04:53:28,253 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:53:28,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:53:28,253 INFO L82 PathProgramCache]: Analyzing trace with hash -613495549, now seen corresponding path program 1 times [2019-09-08 04:53:28,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:53:28,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:53:28,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:53:28,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:53:28,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:53:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:53:28,564 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-08 04:53:28,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:53:28,564 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:53:29,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:53:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:53:29,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 3656 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 04:53:29,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:53:30,216 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-08 04:53:30,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:53:30,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [16] total 30 [2019-09-08 04:53:30,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 04:53:30,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 04:53:30,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=799, Unknown=0, NotChecked=0, Total=870 [2019-09-08 04:53:30,227 INFO L87 Difference]: Start difference. First operand 382229 states and 641844 transitions. Second operand 30 states. [2019-09-08 04:53:50,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:53:50,770 INFO L93 Difference]: Finished difference Result 387682 states and 649039 transitions. [2019-09-08 04:53:50,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 04:53:50,771 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 360 [2019-09-08 04:53:50,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:53:52,063 INFO L225 Difference]: With dead ends: 387682 [2019-09-08 04:53:52,063 INFO L226 Difference]: Without dead ends: 383077 [2019-09-08 04:53:52,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=1503, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 04:53:52,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383077 states. [2019-09-08 04:54:23,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383077 to 382053. [2019-09-08 04:54:23,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382053 states. [2019-09-08 04:54:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382053 states to 382053 states and 641470 transitions. [2019-09-08 04:54:25,327 INFO L78 Accepts]: Start accepts. Automaton has 382053 states and 641470 transitions. Word has length 360 [2019-09-08 04:54:25,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:54:25,327 INFO L475 AbstractCegarLoop]: Abstraction has 382053 states and 641470 transitions. [2019-09-08 04:54:25,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 04:54:25,327 INFO L276 IsEmpty]: Start isEmpty. Operand 382053 states and 641470 transitions. [2019-09-08 04:54:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-08 04:54:26,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:54:26,934 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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, 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] [2019-09-08 04:54:26,934 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:54:26,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:54:26,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1363962803, now seen corresponding path program 1 times [2019-09-08 04:54:26,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:54:26,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:54:26,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:26,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:54:26,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:54:27,363 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-09-08 04:54:27,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:54:27,364 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:54:27,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:54:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:54:27,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 3753 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 04:54:27,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:54:28,963 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-08 04:54:28,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:54:28,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [24] total 29 [2019-09-08 04:54:28,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 04:54:28,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 04:54:28,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=753, Unknown=0, NotChecked=0, Total=812 [2019-09-08 04:54:28,986 INFO L87 Difference]: Start difference. First operand 382053 states and 641470 transitions. Second operand 29 states. [2019-09-08 04:54:48,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:54:48,414 INFO L93 Difference]: Finished difference Result 534491 states and 898106 transitions. [2019-09-08 04:54:48,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 04:54:48,415 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 382 [2019-09-08 04:54:48,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:54:49,501 INFO L225 Difference]: With dead ends: 534491 [2019-09-08 04:54:49,501 INFO L226 Difference]: Without dead ends: 342607 [2019-09-08 04:54:49,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=197, Invalid=2995, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 04:54:50,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342607 states. [2019-09-08 04:55:19,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342607 to 342438. [2019-09-08 04:55:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342438 states. [2019-09-08 04:55:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342438 states to 342438 states and 571540 transitions. [2019-09-08 04:55:20,497 INFO L78 Accepts]: Start accepts. Automaton has 342438 states and 571540 transitions. Word has length 382 [2019-09-08 04:55:20,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:55:20,498 INFO L475 AbstractCegarLoop]: Abstraction has 342438 states and 571540 transitions. [2019-09-08 04:55:20,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 04:55:20,498 INFO L276 IsEmpty]: Start isEmpty. Operand 342438 states and 571540 transitions. [2019-09-08 04:55:23,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-08 04:55:23,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:55:23,105 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 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:55:23,106 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:55:23,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:55:23,106 INFO L82 PathProgramCache]: Analyzing trace with hash 476470680, now seen corresponding path program 1 times [2019-09-08 04:55:23,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:55:23,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:55:23,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:55:23,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:55:23,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:55:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:55:23,342 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 04:55:23,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:55:23,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:55:23,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:55:23,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:55:23,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:55:23,344 INFO L87 Difference]: Start difference. First operand 342438 states and 571540 transitions. Second operand 10 states. [2019-09-08 04:55:41,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:55:41,714 INFO L93 Difference]: Finished difference Result 345478 states and 575346 transitions. [2019-09-08 04:55:41,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:55:41,714 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 357 [2019-09-08 04:55:41,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:55:42,932 INFO L225 Difference]: With dead ends: 345478 [2019-09-08 04:55:42,932 INFO L226 Difference]: Without dead ends: 342478 [2019-09-08 04:55:43,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:55:43,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342478 states.