java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec0_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:29:00,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:29:00,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:29:00,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:29:00,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:29:00,515 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:29:00,516 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:29:00,518 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:29:00,520 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:29:00,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:29:00,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:29:00,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:29:00,523 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:29:00,524 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:29:00,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:29:00,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:29:00,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:29:00,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:29:00,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:29:00,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:29:00,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:29:00,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:29:00,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:29:00,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:29:00,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:29:00,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:29:00,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:29:00,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:29:00,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:29:00,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:29:00,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:29:00,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:29:00,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:29:00,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:29:00,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:29:00,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:29:00,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:29:00,547 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:29:00,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:29:00,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:29:00,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:29:00,549 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 04:29:00,569 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:29:00,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:29:00,572 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:29:00,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:29:00,572 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:29:00,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:29:00,573 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:29:00,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:29:00,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:29:00,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:29:00,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:29:00,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:29:00,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:29:00,574 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:29:00,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:29:00,575 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:29:00,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:29:00,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:29:00,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:29:00,575 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:29:00,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:29:00,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:29:00,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:29:00,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:29:00,577 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:29:00,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:29:00,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:29:00,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:29:00,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:29:00,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:29:00,623 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:29:00,629 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:29:00,631 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:29:00,632 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:29:00,633 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product31.cil.c [2019-09-08 04:29:00,714 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cea1dd258/58d6857ddad84c24982d6db2f26d7989/FLAG27f169b89 [2019-09-08 04:29:01,393 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:29:01,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product31.cil.c [2019-09-08 04:29:01,414 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cea1dd258/58d6857ddad84c24982d6db2f26d7989/FLAG27f169b89 [2019-09-08 04:29:01,628 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cea1dd258/58d6857ddad84c24982d6db2f26d7989 [2019-09-08 04:29:01,639 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:29:01,640 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:29:01,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:29:01,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:29:01,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:29:01,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:29:01" (1/1) ... [2019-09-08 04:29:01,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51fffac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:01, skipping insertion in model container [2019-09-08 04:29:01,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:29:01" (1/1) ... [2019-09-08 04:29:01,656 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:29:01,727 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:29:02,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:29:02,563 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:29:02,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:29:02,812 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:29:02,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:02 WrapperNode [2019-09-08 04:29:02,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:29:02,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:29:02,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:29:02,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:29:02,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:02" (1/1) ... [2019-09-08 04:29:02,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:02" (1/1) ... [2019-09-08 04:29:02,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:02" (1/1) ... [2019-09-08 04:29:02,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:02" (1/1) ... [2019-09-08 04:29:02,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:02" (1/1) ... [2019-09-08 04:29:02,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:02" (1/1) ... [2019-09-08 04:29:02,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:02" (1/1) ... [2019-09-08 04:29:03,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:29:03,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:29:03,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:29:03,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:29:03,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:29:03,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:29:03,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:29:03,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:29:03,102 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 04:29:03,103 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 04:29:03,103 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 04:29:03,103 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 04:29:03,103 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 04:29:03,104 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 04:29:03,105 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 04:29:03,105 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 04:29:03,105 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 04:29:03,106 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 04:29:03,106 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 04:29:03,107 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 04:29:03,107 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 04:29:03,110 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 04:29:03,111 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 04:29:03,111 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 04:29:03,111 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 04:29:03,111 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 04:29:03,112 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 04:29:03,112 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 04:29:03,112 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 04:29:03,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:29:03,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:29:03,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:29:03,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:29:03,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:29:03,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:29:03,113 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:29:03,113 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 04:29:03,113 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 04:29:03,114 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 04:29:03,114 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 04:29:03,114 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 04:29:03,114 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 04:29:03,115 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 04:29:03,115 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 04:29:03,115 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:29:03,115 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:29:03,116 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 04:29:03,116 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 04:29:03,116 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 04:29:03,116 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 04:29:03,116 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 04:29:03,116 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 04:29:03,117 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 04:29:03,117 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 04:29:03,117 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 04:29:03,117 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 04:29:03,117 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 04:29:03,117 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 04:29:03,118 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-09-08 04:29:03,118 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 04:29:03,118 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 04:29:03,118 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 04:29:03,118 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-08 04:29:03,118 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 04:29:03,118 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 04:29:03,119 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 04:29:03,119 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 04:29:03,119 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 04:29:03,119 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 04:29:03,119 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 04:29:03,119 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 04:29:03,120 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 04:29:03,120 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 04:29:03,121 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 04:29:03,121 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 04:29:03,121 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 04:29:03,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2019-09-08 04:29:03,121 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:29:03,122 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:29:03,123 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:29:03,123 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:29:03,123 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:29:03,123 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 04:29:03,124 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 04:29:03,124 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 04:29:03,124 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 04:29:03,124 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 04:29:03,125 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 04:29:03,125 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 04:29:03,125 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 04:29:03,125 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 04:29:03,126 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 04:29:03,127 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 04:29:03,127 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 04:29:03,127 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 04:29:03,128 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 04:29:03,128 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 04:29:03,128 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 04:29:03,128 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 04:29:03,129 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 04:29:03,129 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 04:29:03,129 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 04:29:03,129 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 04:29:03,129 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 04:29:03,129 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 04:29:03,130 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 04:29:03,130 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 04:29:03,130 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 04:29:03,130 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 04:29:03,130 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 04:29:03,130 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 04:29:03,130 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 04:29:03,131 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Encrypt [2019-09-08 04:29:03,131 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-08 04:29:03,131 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 04:29:03,131 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 04:29:03,131 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 04:29:03,132 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 04:29:03,132 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 04:29:03,132 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 04:29:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:29:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:29:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 04:29:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 04:29:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 04:29:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 04:29:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 04:29:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 04:29:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 04:29:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 04:29:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 04:29:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 04:29:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 04:29:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 04:29:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 04:29:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 04:29:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 04:29:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 04:29:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 04:29:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 04:29:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 04:29:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 04:29:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 04:29:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:29:03,140 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:29:03,144 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:29:03,145 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:29:03,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:29:03,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:29:03,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:29:03,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:29:03,156 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:29:03,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:29:03,156 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:29:03,156 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:29:03,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:29:03,157 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:29:03,157 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:29:03,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:29:03,157 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:29:03,157 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 04:29:03,157 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 04:29:03,158 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 04:29:03,158 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 04:29:03,158 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 04:29:03,158 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 04:29:03,158 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 04:29:03,158 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 04:29:03,158 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 04:29:03,159 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:29:03,159 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:29:03,159 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 04:29:03,159 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 04:29:03,159 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 04:29:03,159 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 04:29:03,159 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 04:29:03,160 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 04:29:03,160 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 04:29:03,160 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 04:29:03,160 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 04:29:03,160 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:29:03,160 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:29:03,161 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:29:03,161 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 04:29:03,161 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 04:29:03,161 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 04:29:03,161 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 04:29:03,162 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 04:29:03,162 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 04:29:03,162 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 04:29:03,162 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 04:29:03,163 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 04:29:03,163 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 04:29:03,163 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:29:03,163 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:29:03,163 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 04:29:03,164 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 04:29:03,164 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 04:29:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 04:29:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 04:29:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 04:29:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 04:29:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 04:29:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 04:29:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 04:29:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 04:29:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 04:29:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 04:29:03,167 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 04:29:03,167 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 04:29:03,167 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 04:29:03,167 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 04:29:03,167 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 04:29:03,168 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 04:29:03,168 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 04:29:03,168 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 04:29:03,168 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 04:29:03,168 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 04:29:03,168 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-09-08 04:29:03,169 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 04:29:03,169 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-08 04:29:03,169 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 04:29:03,169 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2019-09-08 04:29:03,169 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:29:03,169 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:29:03,170 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 04:29:03,170 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 04:29:03,170 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 04:29:03,170 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 04:29:03,170 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 04:29:03,171 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 04:29:03,171 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 04:29:03,171 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 04:29:03,171 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 04:29:03,171 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 04:29:03,171 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 04:29:03,171 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 04:29:03,172 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 04:29:03,172 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 04:29:03,172 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 04:29:03,172 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 04:29:03,172 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 04:29:03,172 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 04:29:03,173 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Encrypt [2019-09-08 04:29:03,173 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-08 04:29:03,173 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 04:29:03,173 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 04:29:03,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:29:03,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:29:03,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:29:05,226 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:29:05,227 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 04:29:05,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:29:05 BoogieIcfgContainer [2019-09-08 04:29:05,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:29:05,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:29:05,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:29:05,234 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:29:05,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:29:01" (1/3) ... [2019-09-08 04:29:05,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1782b9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:29:05, skipping insertion in model container [2019-09-08 04:29:05,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:02" (2/3) ... [2019-09-08 04:29:05,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1782b9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:29:05, skipping insertion in model container [2019-09-08 04:29:05,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:29:05" (3/3) ... [2019-09-08 04:29:05,238 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product31.cil.c [2019-09-08 04:29:05,248 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:29:05,258 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:29:05,275 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:29:05,313 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:29:05,314 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:29:05,314 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:29:05,315 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:29:05,315 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:29:05,315 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:29:05,315 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:29:05,315 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:29:05,315 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:29:05,347 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states. [2019-09-08 04:29:05,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 04:29:05,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:05,374 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:05,377 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:05,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:05,384 INFO L82 PathProgramCache]: Analyzing trace with hash -502601310, now seen corresponding path program 1 times [2019-09-08 04:29:05,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:05,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:05,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:05,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:05,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:06,156 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:29:06,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:06,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 04:29:06,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 04:29:06,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 04:29:06,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:29:06,185 INFO L87 Difference]: Start difference. First operand 555 states. Second operand 2 states. [2019-09-08 04:29:06,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:06,334 INFO L93 Difference]: Finished difference Result 852 states and 1120 transitions. [2019-09-08 04:29:06,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 04:29:06,337 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 221 [2019-09-08 04:29:06,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:06,380 INFO L225 Difference]: With dead ends: 852 [2019-09-08 04:29:06,380 INFO L226 Difference]: Without dead ends: 532 [2019-09-08 04:29:06,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:29:06,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-09-08 04:29:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2019-09-08 04:29:06,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-09-08 04:29:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 702 transitions. [2019-09-08 04:29:06,554 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 702 transitions. Word has length 221 [2019-09-08 04:29:06,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:06,558 INFO L475 AbstractCegarLoop]: Abstraction has 532 states and 702 transitions. [2019-09-08 04:29:06,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 04:29:06,558 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 702 transitions. [2019-09-08 04:29:06,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-08 04:29:06,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:06,572 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:06,572 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:06,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:06,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1959572601, now seen corresponding path program 1 times [2019-09-08 04:29:06,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:06,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:06,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:06,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:06,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:29:06,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:06,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:29:06,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:29:06,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:29:06,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:29:06,958 INFO L87 Difference]: Start difference. First operand 532 states and 702 transitions. Second operand 3 states. [2019-09-08 04:29:07,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:07,010 INFO L93 Difference]: Finished difference Result 835 states and 1084 transitions. [2019-09-08 04:29:07,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:29:07,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-09-08 04:29:07,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:07,016 INFO L225 Difference]: With dead ends: 835 [2019-09-08 04:29:07,016 INFO L226 Difference]: Without dead ends: 535 [2019-09-08 04:29:07,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:29:07,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-08 04:29:07,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 534. [2019-09-08 04:29:07,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-09-08 04:29:07,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 704 transitions. [2019-09-08 04:29:07,041 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 704 transitions. Word has length 222 [2019-09-08 04:29:07,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:07,042 INFO L475 AbstractCegarLoop]: Abstraction has 534 states and 704 transitions. [2019-09-08 04:29:07,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:29:07,042 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 704 transitions. [2019-09-08 04:29:07,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 04:29:07,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:07,047 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:07,048 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:07,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:07,048 INFO L82 PathProgramCache]: Analyzing trace with hash 804976229, now seen corresponding path program 1 times [2019-09-08 04:29:07,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:07,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:07,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:07,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:07,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:29:07,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:07,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:29:07,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:29:07,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:29:07,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:29:07,245 INFO L87 Difference]: Start difference. First operand 534 states and 704 transitions. Second operand 3 states. [2019-09-08 04:29:07,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:07,299 INFO L93 Difference]: Finished difference Result 1044 states and 1406 transitions. [2019-09-08 04:29:07,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:29:07,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2019-09-08 04:29:07,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:07,308 INFO L225 Difference]: With dead ends: 1044 [2019-09-08 04:29:07,308 INFO L226 Difference]: Without dead ends: 575 [2019-09-08 04:29:07,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:29:07,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-09-08 04:29:07,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 574. [2019-09-08 04:29:07,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-08 04:29:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 773 transitions. [2019-09-08 04:29:07,348 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 773 transitions. Word has length 228 [2019-09-08 04:29:07,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:07,348 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 773 transitions. [2019-09-08 04:29:07,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:29:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 773 transitions. [2019-09-08 04:29:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 04:29:07,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:07,354 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:07,355 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:07,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:07,355 INFO L82 PathProgramCache]: Analyzing trace with hash 621329804, now seen corresponding path program 1 times [2019-09-08 04:29:07,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:07,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:07,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:07,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:07,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:07,899 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 04:29:07,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:07,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 04:29:07,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 04:29:07,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 04:29:07,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:29:07,902 INFO L87 Difference]: Start difference. First operand 574 states and 773 transitions. Second operand 19 states. [2019-09-08 04:29:12,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:12,860 INFO L93 Difference]: Finished difference Result 2042 states and 2759 transitions. [2019-09-08 04:29:12,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 04:29:12,863 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 229 [2019-09-08 04:29:12,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:12,878 INFO L225 Difference]: With dead ends: 2042 [2019-09-08 04:29:12,879 INFO L226 Difference]: Without dead ends: 1755 [2019-09-08 04:29:12,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 04:29:12,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2019-09-08 04:29:12,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1718. [2019-09-08 04:29:12,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2019-09-08 04:29:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2329 transitions. [2019-09-08 04:29:13,008 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2329 transitions. Word has length 229 [2019-09-08 04:29:13,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:13,009 INFO L475 AbstractCegarLoop]: Abstraction has 1718 states and 2329 transitions. [2019-09-08 04:29:13,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 04:29:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2329 transitions. [2019-09-08 04:29:13,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 04:29:13,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:13,017 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:13,018 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:13,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:13,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1402859165, now seen corresponding path program 1 times [2019-09-08 04:29:13,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:13,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:13,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:13,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:13,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:13,407 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 04:29:13,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:13,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 04:29:13,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 04:29:13,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 04:29:13,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:29:13,409 INFO L87 Difference]: Start difference. First operand 1718 states and 2329 transitions. Second operand 16 states. [2019-09-08 04:29:13,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:13,838 INFO L93 Difference]: Finished difference Result 3039 states and 4081 transitions. [2019-09-08 04:29:13,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 04:29:13,839 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 230 [2019-09-08 04:29:13,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:13,853 INFO L225 Difference]: With dead ends: 3039 [2019-09-08 04:29:13,853 INFO L226 Difference]: Without dead ends: 1800 [2019-09-08 04:29:13,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-09-08 04:29:13,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2019-09-08 04:29:13,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1800. [2019-09-08 04:29:13,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2019-09-08 04:29:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2442 transitions. [2019-09-08 04:29:13,977 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2442 transitions. Word has length 230 [2019-09-08 04:29:13,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:13,982 INFO L475 AbstractCegarLoop]: Abstraction has 1800 states and 2442 transitions. [2019-09-08 04:29:13,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 04:29:13,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2442 transitions. [2019-09-08 04:29:13,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 04:29:13,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:13,990 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:13,990 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:13,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:13,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1144463917, now seen corresponding path program 1 times [2019-09-08 04:29:13,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:13,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:13,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:13,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:13,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:14,371 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 04:29:14,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:14,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 04:29:14,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 04:29:14,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 04:29:14,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:29:14,374 INFO L87 Difference]: Start difference. First operand 1800 states and 2442 transitions. Second operand 15 states. [2019-09-08 04:29:18,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:18,708 INFO L93 Difference]: Finished difference Result 3089 states and 4140 transitions. [2019-09-08 04:29:18,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 04:29:18,709 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 230 [2019-09-08 04:29:18,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:18,729 INFO L225 Difference]: With dead ends: 3089 [2019-09-08 04:29:18,730 INFO L226 Difference]: Without dead ends: 1882 [2019-09-08 04:29:18,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 04:29:18,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2019-09-08 04:29:18,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1829. [2019-09-08 04:29:18,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2019-09-08 04:29:18,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2490 transitions. [2019-09-08 04:29:18,852 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2490 transitions. Word has length 230 [2019-09-08 04:29:18,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:18,853 INFO L475 AbstractCegarLoop]: Abstraction has 1829 states and 2490 transitions. [2019-09-08 04:29:18,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 04:29:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2490 transitions. [2019-09-08 04:29:18,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 04:29:18,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:18,862 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:18,862 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:18,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:18,863 INFO L82 PathProgramCache]: Analyzing trace with hash -746069554, now seen corresponding path program 1 times [2019-09-08 04:29:18,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:18,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:18,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:18,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:18,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-08 04:29:19,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:19,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:29:19,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:29:19,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:29:19,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:29:19,069 INFO L87 Difference]: Start difference. First operand 1829 states and 2490 transitions. Second operand 5 states. [2019-09-08 04:29:20,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:20,558 INFO L93 Difference]: Finished difference Result 4646 states and 6312 transitions. [2019-09-08 04:29:20,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:29:20,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2019-09-08 04:29:20,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:20,606 INFO L225 Difference]: With dead ends: 4646 [2019-09-08 04:29:20,607 INFO L226 Difference]: Without dead ends: 4009 [2019-09-08 04:29:20,613 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:29:20,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2019-09-08 04:29:20,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 3978. [2019-09-08 04:29:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3978 states. [2019-09-08 04:29:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 5410 transitions. [2019-09-08 04:29:20,908 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 5410 transitions. Word has length 230 [2019-09-08 04:29:20,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:20,909 INFO L475 AbstractCegarLoop]: Abstraction has 3978 states and 5410 transitions. [2019-09-08 04:29:20,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:29:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 5410 transitions. [2019-09-08 04:29:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 04:29:20,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:20,926 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:20,927 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:20,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:20,930 INFO L82 PathProgramCache]: Analyzing trace with hash -70376945, now seen corresponding path program 1 times [2019-09-08 04:29:20,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:20,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:20,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:20,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:20,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 04:29:21,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:29:21,163 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:29:21,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:21,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 2935 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:29:21,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:29:22,243 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:29:22,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:29:22,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-09-08 04:29:22,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:29:22,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:29:22,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:29:22,269 INFO L87 Difference]: Start difference. First operand 3978 states and 5410 transitions. Second operand 14 states. [2019-09-08 04:29:30,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:30,327 INFO L93 Difference]: Finished difference Result 14312 states and 20251 transitions. [2019-09-08 04:29:30,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 04:29:30,328 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 230 [2019-09-08 04:29:30,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:30,396 INFO L225 Difference]: With dead ends: 14312 [2019-09-08 04:29:30,396 INFO L226 Difference]: Without dead ends: 10370 [2019-09-08 04:29:30,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2019-09-08 04:29:30,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10370 states. [2019-09-08 04:29:31,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10370 to 10352. [2019-09-08 04:29:31,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10352 states. [2019-09-08 04:29:31,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10352 states to 10352 states and 14336 transitions. [2019-09-08 04:29:31,192 INFO L78 Accepts]: Start accepts. Automaton has 10352 states and 14336 transitions. Word has length 230 [2019-09-08 04:29:31,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:31,193 INFO L475 AbstractCegarLoop]: Abstraction has 10352 states and 14336 transitions. [2019-09-08 04:29:31,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 04:29:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 10352 states and 14336 transitions. [2019-09-08 04:29:31,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-08 04:29:31,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:31,214 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:29:31,215 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:31,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:31,215 INFO L82 PathProgramCache]: Analyzing trace with hash -581824491, now seen corresponding path program 1 times [2019-09-08 04:29:31,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:31,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:31,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:31,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:31,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 04:29:31,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:29:31,810 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:29:31,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:32,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 2938 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 04:29:32,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:29:32,679 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:29:32,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:29:32,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [24] total 29 [2019-09-08 04:29:32,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 04:29:32,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 04:29:32,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=753, Unknown=0, NotChecked=0, Total=812 [2019-09-08 04:29:32,689 INFO L87 Difference]: Start difference. First operand 10352 states and 14336 transitions. Second operand 29 states. [2019-09-08 04:29:35,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:35,930 INFO L93 Difference]: Finished difference Result 20916 states and 29747 transitions. [2019-09-08 04:29:35,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 04:29:35,930 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 233 [2019-09-08 04:29:35,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:36,014 INFO L225 Difference]: With dead ends: 20916 [2019-09-08 04:29:36,015 INFO L226 Difference]: Without dead ends: 9915 [2019-09-08 04:29:36,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=177, Invalid=2579, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 04:29:36,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9915 states. [2019-09-08 04:29:36,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9915 to 9717. [2019-09-08 04:29:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9717 states. [2019-09-08 04:29:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9717 states to 9717 states and 13456 transitions. [2019-09-08 04:29:36,954 INFO L78 Accepts]: Start accepts. Automaton has 9717 states and 13456 transitions. Word has length 233 [2019-09-08 04:29:36,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:36,954 INFO L475 AbstractCegarLoop]: Abstraction has 9717 states and 13456 transitions. [2019-09-08 04:29:36,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 04:29:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 9717 states and 13456 transitions. [2019-09-08 04:29:36,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 04:29:36,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:36,979 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:36,980 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:36,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:36,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1177667777, now seen corresponding path program 1 times [2019-09-08 04:29:36,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:36,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:36,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:36,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:36,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:37,248 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:29:37,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:29:37,249 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:29:37,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:37,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 2954 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:29:37,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:29:37,871 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 04:29:37,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:29:37,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2019-09-08 04:29:37,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 04:29:37,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 04:29:37,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:29:37,890 INFO L87 Difference]: Start difference. First operand 9717 states and 13456 transitions. Second operand 17 states. [2019-09-08 04:29:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:40,801 INFO L93 Difference]: Finished difference Result 19983 states and 28061 transitions. [2019-09-08 04:29:40,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 04:29:40,801 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 238 [2019-09-08 04:29:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:40,866 INFO L225 Difference]: With dead ends: 19983 [2019-09-08 04:29:40,867 INFO L226 Difference]: Without dead ends: 10327 [2019-09-08 04:29:40,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2019-09-08 04:29:40,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10327 states. [2019-09-08 04:29:41,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10327 to 9847. [2019-09-08 04:29:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9847 states. [2019-09-08 04:29:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9847 states to 9847 states and 13627 transitions. [2019-09-08 04:29:41,401 INFO L78 Accepts]: Start accepts. Automaton has 9847 states and 13627 transitions. Word has length 238 [2019-09-08 04:29:41,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:41,402 INFO L475 AbstractCegarLoop]: Abstraction has 9847 states and 13627 transitions. [2019-09-08 04:29:41,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 04:29:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 9847 states and 13627 transitions. [2019-09-08 04:29:41,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 04:29:41,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:41,428 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:41,428 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:41,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:41,429 INFO L82 PathProgramCache]: Analyzing trace with hash 741901079, now seen corresponding path program 1 times [2019-09-08 04:29:41,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:41,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:41,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:41,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:41,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:29:41,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:41,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:29:41,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:29:41,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:29:41,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:29:41,632 INFO L87 Difference]: Start difference. First operand 9847 states and 13627 transitions. Second operand 6 states. [2019-09-08 04:29:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:43,554 INFO L93 Difference]: Finished difference Result 28352 states and 38983 transitions. [2019-09-08 04:29:43,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:29:43,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 246 [2019-09-08 04:29:43,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:43,645 INFO L225 Difference]: With dead ends: 28352 [2019-09-08 04:29:43,645 INFO L226 Difference]: Without dead ends: 19825 [2019-09-08 04:29:43,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:29:43,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19825 states. [2019-09-08 04:29:44,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19825 to 19720. [2019-09-08 04:29:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19720 states. [2019-09-08 04:29:44,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19720 states to 19720 states and 27256 transitions. [2019-09-08 04:29:44,657 INFO L78 Accepts]: Start accepts. Automaton has 19720 states and 27256 transitions. Word has length 246 [2019-09-08 04:29:44,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:44,658 INFO L475 AbstractCegarLoop]: Abstraction has 19720 states and 27256 transitions. [2019-09-08 04:29:44,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:29:44,659 INFO L276 IsEmpty]: Start isEmpty. Operand 19720 states and 27256 transitions. [2019-09-08 04:29:44,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-08 04:29:44,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:44,688 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:44,688 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:44,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:44,689 INFO L82 PathProgramCache]: Analyzing trace with hash -468510016, now seen corresponding path program 1 times [2019-09-08 04:29:44,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:44,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:44,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:44,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:44,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:44,892 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:29:44,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:44,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:29:44,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:29:44,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:29:44,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:29:44,894 INFO L87 Difference]: Start difference. First operand 19720 states and 27256 transitions. Second operand 11 states. [2019-09-08 04:29:45,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:45,796 INFO L93 Difference]: Finished difference Result 35601 states and 49103 transitions. [2019-09-08 04:29:45,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:29:45,797 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 247 [2019-09-08 04:29:45,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:45,912 INFO L225 Difference]: With dead ends: 35601 [2019-09-08 04:29:45,913 INFO L226 Difference]: Without dead ends: 21070 [2019-09-08 04:29:45,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:29:45,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21070 states. [2019-09-08 04:29:47,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21070 to 20876. [2019-09-08 04:29:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20876 states. [2019-09-08 04:29:47,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20876 states to 20876 states and 29142 transitions. [2019-09-08 04:29:47,637 INFO L78 Accepts]: Start accepts. Automaton has 20876 states and 29142 transitions. Word has length 247 [2019-09-08 04:29:47,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:47,638 INFO L475 AbstractCegarLoop]: Abstraction has 20876 states and 29142 transitions. [2019-09-08 04:29:47,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:29:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 20876 states and 29142 transitions. [2019-09-08 04:29:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-08 04:29:47,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:47,679 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:47,680 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:47,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:47,681 INFO L82 PathProgramCache]: Analyzing trace with hash -987361767, now seen corresponding path program 1 times [2019-09-08 04:29:47,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:47,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:47,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:47,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:47,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:47,986 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:29:47,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:47,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:29:47,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:29:47,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:29:47,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:29:47,990 INFO L87 Difference]: Start difference. First operand 20876 states and 29142 transitions. Second operand 6 states. [2019-09-08 04:29:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:49,639 INFO L93 Difference]: Finished difference Result 60018 states and 83113 transitions. [2019-09-08 04:29:49,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:29:49,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 248 [2019-09-08 04:29:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:49,903 INFO L225 Difference]: With dead ends: 60018 [2019-09-08 04:29:49,903 INFO L226 Difference]: Without dead ends: 42123 [2019-09-08 04:29:51,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:29:51,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42123 states. [2019-09-08 04:29:53,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42123 to 41738. [2019-09-08 04:29:53,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41738 states. [2019-09-08 04:29:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41738 states to 41738 states and 58245 transitions. [2019-09-08 04:29:53,489 INFO L78 Accepts]: Start accepts. Automaton has 41738 states and 58245 transitions. Word has length 248 [2019-09-08 04:29:53,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:53,490 INFO L475 AbstractCegarLoop]: Abstraction has 41738 states and 58245 transitions. [2019-09-08 04:29:53,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:29:53,490 INFO L276 IsEmpty]: Start isEmpty. Operand 41738 states and 58245 transitions. [2019-09-08 04:29:53,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 04:29:53,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:53,542 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:53,542 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:53,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:53,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1804181114, now seen corresponding path program 1 times [2019-09-08 04:29:53,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:53,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:53,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:53,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:53,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:29:53,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:53,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:29:53,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:29:53,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:29:53,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:29:53,770 INFO L87 Difference]: Start difference. First operand 41738 states and 58245 transitions. Second operand 11 states. [2019-09-08 04:29:54,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:54,944 INFO L93 Difference]: Finished difference Result 74791 states and 104049 transitions. [2019-09-08 04:29:54,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:29:54,945 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 249 [2019-09-08 04:29:54,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:55,227 INFO L225 Difference]: With dead ends: 74791 [2019-09-08 04:29:55,227 INFO L226 Difference]: Without dead ends: 44438 [2019-09-08 04:29:55,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:29:55,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44438 states. [2019-09-08 04:29:57,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44438 to 44002. [2019-09-08 04:29:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44002 states. [2019-09-08 04:29:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44002 states to 44002 states and 61992 transitions. [2019-09-08 04:29:57,571 INFO L78 Accepts]: Start accepts. Automaton has 44002 states and 61992 transitions. Word has length 249 [2019-09-08 04:29:57,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:57,571 INFO L475 AbstractCegarLoop]: Abstraction has 44002 states and 61992 transitions. [2019-09-08 04:29:57,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:29:57,571 INFO L276 IsEmpty]: Start isEmpty. Operand 44002 states and 61992 transitions. [2019-09-08 04:29:57,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 04:29:57,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:57,618 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:57,619 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:57,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:57,619 INFO L82 PathProgramCache]: Analyzing trace with hash -881150193, now seen corresponding path program 1 times [2019-09-08 04:29:57,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:57,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:57,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:57,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:57,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:29:57,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:57,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:29:57,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:29:57,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:29:57,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:29:57,803 INFO L87 Difference]: Start difference. First operand 44002 states and 61992 transitions. Second operand 6 states. [2019-09-08 04:30:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:00,711 INFO L93 Difference]: Finished difference Result 124275 states and 173658 transitions. [2019-09-08 04:30:00,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:30:00,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 250 [2019-09-08 04:30:00,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:01,065 INFO L225 Difference]: With dead ends: 124275 [2019-09-08 04:30:01,066 INFO L226 Difference]: Without dead ends: 78797 [2019-09-08 04:30:01,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:30:01,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78797 states. [2019-09-08 04:30:06,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78797 to 78070. [2019-09-08 04:30:06,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78070 states. [2019-09-08 04:30:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78070 states to 78070 states and 110427 transitions. [2019-09-08 04:30:06,767 INFO L78 Accepts]: Start accepts. Automaton has 78070 states and 110427 transitions. Word has length 250 [2019-09-08 04:30:06,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:06,767 INFO L475 AbstractCegarLoop]: Abstraction has 78070 states and 110427 transitions. [2019-09-08 04:30:06,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:30:06,767 INFO L276 IsEmpty]: Start isEmpty. Operand 78070 states and 110427 transitions. [2019-09-08 04:30:06,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-08 04:30:06,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:06,816 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:30:06,816 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:06,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:06,817 INFO L82 PathProgramCache]: Analyzing trace with hash -50911162, now seen corresponding path program 1 times [2019-09-08 04:30:06,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:06,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:06,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:06,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:06,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:06,973 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 04:30:06,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:06,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:30:06,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:30:06,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:30:06,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:30:06,976 INFO L87 Difference]: Start difference. First operand 78070 states and 110427 transitions. Second operand 3 states. [2019-09-08 04:30:09,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:09,276 INFO L93 Difference]: Finished difference Result 158018 states and 224404 transitions. [2019-09-08 04:30:09,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:30:09,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-09-08 04:30:09,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:09,673 INFO L225 Difference]: With dead ends: 158018 [2019-09-08 04:30:09,674 INFO L226 Difference]: Without dead ends: 80035 [2019-09-08 04:30:09,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:30:09,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80035 states. [2019-09-08 04:30:15,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80035 to 80014. [2019-09-08 04:30:15,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80014 states. [2019-09-08 04:30:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80014 states to 80014 states and 114009 transitions. [2019-09-08 04:30:15,422 INFO L78 Accepts]: Start accepts. Automaton has 80014 states and 114009 transitions. Word has length 259 [2019-09-08 04:30:15,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:15,422 INFO L475 AbstractCegarLoop]: Abstraction has 80014 states and 114009 transitions. [2019-09-08 04:30:15,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:30:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand 80014 states and 114009 transitions. [2019-09-08 04:30:15,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-08 04:30:15,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:15,484 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:30:15,484 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:15,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:15,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1302552021, now seen corresponding path program 1 times [2019-09-08 04:30:15,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:15,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:15,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:15,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:15,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 04:30:15,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:15,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:30:15,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:30:15,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:30:15,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:30:15,632 INFO L87 Difference]: Start difference. First operand 80014 states and 114009 transitions. Second operand 3 states. [2019-09-08 04:30:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:17,996 INFO L93 Difference]: Finished difference Result 163610 states and 234766 transitions. [2019-09-08 04:30:17,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:30:17,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-09-08 04:30:17,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:18,302 INFO L225 Difference]: With dead ends: 163610 [2019-09-08 04:30:18,302 INFO L226 Difference]: Without dead ends: 83683 [2019-09-08 04:30:18,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:30:18,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83683 states. [2019-09-08 04:30:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83683 to 83662. [2019-09-08 04:30:24,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83662 states. [2019-09-08 04:30:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83662 states to 83662 states and 120741 transitions. [2019-09-08 04:30:24,333 INFO L78 Accepts]: Start accepts. Automaton has 83662 states and 120741 transitions. Word has length 260 [2019-09-08 04:30:24,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:24,334 INFO L475 AbstractCegarLoop]: Abstraction has 83662 states and 120741 transitions. [2019-09-08 04:30:24,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:30:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 83662 states and 120741 transitions. [2019-09-08 04:30:24,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-08 04:30:24,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:24,407 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:30:24,408 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:24,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:24,408 INFO L82 PathProgramCache]: Analyzing trace with hash -2102792764, now seen corresponding path program 1 times [2019-09-08 04:30:24,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:24,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:24,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:24,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:24,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:24,546 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 04:30:24,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:24,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:30:24,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:30:24,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:30:24,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:30:24,548 INFO L87 Difference]: Start difference. First operand 83662 states and 120741 transitions. Second operand 3 states. [2019-09-08 04:30:27,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:27,401 INFO L93 Difference]: Finished difference Result 174266 states and 254290 transitions. [2019-09-08 04:30:27,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:30:27,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-09-08 04:30:27,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:27,798 INFO L225 Difference]: With dead ends: 174266 [2019-09-08 04:30:27,799 INFO L226 Difference]: Without dead ends: 90691 [2019-09-08 04:30:27,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:30:28,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90691 states. [2019-09-08 04:30:31,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90691 to 90670. [2019-09-08 04:30:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90670 states. [2019-09-08 04:30:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90670 states to 90670 states and 133437 transitions. [2019-09-08 04:30:31,912 INFO L78 Accepts]: Start accepts. Automaton has 90670 states and 133437 transitions. Word has length 261 [2019-09-08 04:30:31,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:31,912 INFO L475 AbstractCegarLoop]: Abstraction has 90670 states and 133437 transitions. [2019-09-08 04:30:31,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:30:31,913 INFO L276 IsEmpty]: Start isEmpty. Operand 90670 states and 133437 transitions. [2019-09-08 04:30:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-08 04:30:31,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:31,987 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:30:31,987 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:31,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:31,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1231279431, now seen corresponding path program 1 times [2019-09-08 04:30:31,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:31,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:31,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:31,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:31,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 04:30:32,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:32,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:30:32,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:30:32,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:30:32,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:30:32,120 INFO L87 Difference]: Start difference. First operand 90670 states and 133437 transitions. Second operand 3 states. [2019-09-08 04:30:37,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:37,426 INFO L93 Difference]: Finished difference Result 194714 states and 291226 transitions. [2019-09-08 04:30:37,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:30:37,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2019-09-08 04:30:37,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:37,835 INFO L225 Difference]: With dead ends: 194714 [2019-09-08 04:30:37,836 INFO L226 Difference]: Without dead ends: 104131 [2019-09-08 04:30:38,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:30:38,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104131 states. [2019-09-08 04:30:44,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104131 to 104110. [2019-09-08 04:30:44,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104110 states. [2019-09-08 04:30:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104110 states to 104110 states and 157485 transitions. [2019-09-08 04:30:44,608 INFO L78 Accepts]: Start accepts. Automaton has 104110 states and 157485 transitions. Word has length 264 [2019-09-08 04:30:44,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:44,609 INFO L475 AbstractCegarLoop]: Abstraction has 104110 states and 157485 transitions. [2019-09-08 04:30:44,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:30:44,609 INFO L276 IsEmpty]: Start isEmpty. Operand 104110 states and 157485 transitions. [2019-09-08 04:30:44,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 04:30:44,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:44,731 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:30:44,731 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:44,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:44,731 INFO L82 PathProgramCache]: Analyzing trace with hash 434118944, now seen corresponding path program 1 times [2019-09-08 04:30:44,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:44,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:44,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:44,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:44,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:44,939 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:30:44,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:44,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:30:44,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:30:44,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:30:44,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:30:44,942 INFO L87 Difference]: Start difference. First operand 104110 states and 157485 transitions. Second operand 11 states. [2019-09-08 04:30:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:47,826 INFO L93 Difference]: Finished difference Result 169773 states and 247766 transitions. [2019-09-08 04:30:47,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:30:47,827 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 265 [2019-09-08 04:30:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:48,328 INFO L225 Difference]: With dead ends: 169773 [2019-09-08 04:30:48,328 INFO L226 Difference]: Without dead ends: 103214 [2019-09-08 04:30:48,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:30:48,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103214 states. [2019-09-08 04:30:56,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103214 to 102822. [2019-09-08 04:30:56,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102822 states. [2019-09-08 04:30:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102822 states to 102822 states and 155217 transitions. [2019-09-08 04:30:57,019 INFO L78 Accepts]: Start accepts. Automaton has 102822 states and 155217 transitions. Word has length 265 [2019-09-08 04:30:57,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:57,019 INFO L475 AbstractCegarLoop]: Abstraction has 102822 states and 155217 transitions. [2019-09-08 04:30:57,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:30:57,019 INFO L276 IsEmpty]: Start isEmpty. Operand 102822 states and 155217 transitions. [2019-09-08 04:30:57,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-08 04:30:57,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:57,133 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:30:57,133 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:57,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:57,133 INFO L82 PathProgramCache]: Analyzing trace with hash -953749244, now seen corresponding path program 1 times [2019-09-08 04:30:57,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:57,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:57,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:57,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:57,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:57,614 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 04:30:57,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:57,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-08 04:30:57,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 04:30:57,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 04:30:57,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-09-08 04:30:57,615 INFO L87 Difference]: Start difference. First operand 102822 states and 155217 transitions. Second operand 28 states. [2019-09-08 04:31:01,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:01,264 INFO L93 Difference]: Finished difference Result 169036 states and 246727 transitions. [2019-09-08 04:31:01,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 04:31:01,265 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 263 [2019-09-08 04:31:01,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:01,735 INFO L225 Difference]: With dead ends: 169036 [2019-09-08 04:31:01,735 INFO L226 Difference]: Without dead ends: 105003 [2019-09-08 04:31:01,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 04:31:02,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105003 states. [2019-09-08 04:31:06,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105003 to 103122. [2019-09-08 04:31:06,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103122 states. [2019-09-08 04:31:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103122 states to 103122 states and 155251 transitions. [2019-09-08 04:31:06,766 INFO L78 Accepts]: Start accepts. Automaton has 103122 states and 155251 transitions. Word has length 263 [2019-09-08 04:31:06,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:06,767 INFO L475 AbstractCegarLoop]: Abstraction has 103122 states and 155251 transitions. [2019-09-08 04:31:06,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 04:31:06,767 INFO L276 IsEmpty]: Start isEmpty. Operand 103122 states and 155251 transitions. [2019-09-08 04:31:06,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-08 04:31:06,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:06,900 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:31:06,900 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:06,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:06,900 INFO L82 PathProgramCache]: Analyzing trace with hash 876374911, now seen corresponding path program 1 times [2019-09-08 04:31:06,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:06,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:06,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:06,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:06,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:07,043 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:31:07,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:07,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:31:07,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:31:07,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:31:07,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:31:07,046 INFO L87 Difference]: Start difference. First operand 103122 states and 155251 transitions. Second operand 5 states. [2019-09-08 04:31:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:10,916 INFO L93 Difference]: Finished difference Result 173758 states and 252771 transitions. [2019-09-08 04:31:10,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:31:10,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 260 [2019-09-08 04:31:10,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:11,254 INFO L225 Difference]: With dead ends: 173758 [2019-09-08 04:31:11,254 INFO L226 Difference]: Without dead ends: 104641 [2019-09-08 04:31:11,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:31:11,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104641 states. [2019-09-08 04:31:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104641 to 103850. [2019-09-08 04:31:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103850 states. [2019-09-08 04:31:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103850 states to 103850 states and 156343 transitions. [2019-09-08 04:31:20,811 INFO L78 Accepts]: Start accepts. Automaton has 103850 states and 156343 transitions. Word has length 260 [2019-09-08 04:31:20,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:20,811 INFO L475 AbstractCegarLoop]: Abstraction has 103850 states and 156343 transitions. [2019-09-08 04:31:20,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:31:20,811 INFO L276 IsEmpty]: Start isEmpty. Operand 103850 states and 156343 transitions. [2019-09-08 04:31:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-08 04:31:20,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:20,925 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:31:20,925 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:20,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:20,926 INFO L82 PathProgramCache]: Analyzing trace with hash -103160249, now seen corresponding path program 1 times [2019-09-08 04:31:20,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:20,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:20,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:20,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:20,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:31:21,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:21,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:31:21,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:31:21,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:31:21,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:31:21,121 INFO L87 Difference]: Start difference. First operand 103850 states and 156343 transitions. Second operand 11 states. [2019-09-08 04:31:24,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:24,934 INFO L93 Difference]: Finished difference Result 173681 states and 252324 transitions. [2019-09-08 04:31:24,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:31:24,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 260 [2019-09-08 04:31:24,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:25,271 INFO L225 Difference]: With dead ends: 173681 [2019-09-08 04:31:25,272 INFO L226 Difference]: Without dead ends: 103720 [2019-09-08 04:31:25,398 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:31:25,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103720 states. [2019-09-08 04:31:32,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103720 to 103236. [2019-09-08 04:31:32,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103236 states. [2019-09-08 04:31:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103236 states to 103236 states and 155237 transitions. [2019-09-08 04:31:33,023 INFO L78 Accepts]: Start accepts. Automaton has 103236 states and 155237 transitions. Word has length 260 [2019-09-08 04:31:33,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:33,024 INFO L475 AbstractCegarLoop]: Abstraction has 103236 states and 155237 transitions. [2019-09-08 04:31:33,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:31:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 103236 states and 155237 transitions. [2019-09-08 04:31:33,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 04:31:33,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:33,160 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:31:33,160 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:33,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:33,160 INFO L82 PathProgramCache]: Analyzing trace with hash 534400165, now seen corresponding path program 1 times [2019-09-08 04:31:33,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:33,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:33,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:33,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:33,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:31:33,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:33,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:31:33,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:31:33,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:31:33,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:31:33,346 INFO L87 Difference]: Start difference. First operand 103236 states and 155237 transitions. Second operand 10 states. [2019-09-08 04:31:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:35,770 INFO L93 Difference]: Finished difference Result 103241 states and 155241 transitions. [2019-09-08 04:31:35,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:31:35,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 267 [2019-09-08 04:31:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:36,170 INFO L225 Difference]: With dead ends: 103241 [2019-09-08 04:31:36,170 INFO L226 Difference]: Without dead ends: 103236 [2019-09-08 04:31:36,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:31:36,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103236 states. [2019-09-08 04:31:40,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103236 to 103236. [2019-09-08 04:31:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103236 states. [2019-09-08 04:31:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103236 states to 103236 states and 154822 transitions. [2019-09-08 04:31:41,284 INFO L78 Accepts]: Start accepts. Automaton has 103236 states and 154822 transitions. Word has length 267 [2019-09-08 04:31:41,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:41,284 INFO L475 AbstractCegarLoop]: Abstraction has 103236 states and 154822 transitions. [2019-09-08 04:31:41,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:31:41,285 INFO L276 IsEmpty]: Start isEmpty. Operand 103236 states and 154822 transitions. [2019-09-08 04:31:41,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-08 04:31:41,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:41,420 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:31:41,420 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:41,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:41,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1201317683, now seen corresponding path program 1 times [2019-09-08 04:31:41,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:41,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:41,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:41,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:41,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:42,361 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:31:42,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:42,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:31:42,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:31:42,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:31:42,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:31:42,363 INFO L87 Difference]: Start difference. First operand 103236 states and 154822 transitions. Second operand 6 states. [2019-09-08 04:31:51,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:51,470 INFO L93 Difference]: Finished difference Result 272964 states and 405102 transitions. [2019-09-08 04:31:51,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:31:51,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 263 [2019-09-08 04:31:51,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:52,385 INFO L225 Difference]: With dead ends: 272964 [2019-09-08 04:31:52,385 INFO L226 Difference]: Without dead ends: 206931 [2019-09-08 04:31:52,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:31:52,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206931 states. [2019-09-08 04:32:00,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206931 to 205430. [2019-09-08 04:32:00,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205430 states. [2019-09-08 04:32:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205430 states to 205430 states and 313021 transitions. [2019-09-08 04:32:01,722 INFO L78 Accepts]: Start accepts. Automaton has 205430 states and 313021 transitions. Word has length 263 [2019-09-08 04:32:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:01,722 INFO L475 AbstractCegarLoop]: Abstraction has 205430 states and 313021 transitions. [2019-09-08 04:32:01,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:32:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 205430 states and 313021 transitions. [2019-09-08 04:32:02,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-08 04:32:02,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:02,074 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 04:32:02,075 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:02,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:02,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1819463845, now seen corresponding path program 1 times [2019-09-08 04:32:02,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:02,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:02,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:02,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:02,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 04:32:02,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:02,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:32:02,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:32:02,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:32:02,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:32:02,291 INFO L87 Difference]: Start difference. First operand 205430 states and 313021 transitions. Second operand 8 states. [2019-09-08 04:32:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:21,145 INFO L93 Difference]: Finished difference Result 556498 states and 834641 transitions. [2019-09-08 04:32:21,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:32:21,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 280 [2019-09-08 04:32:21,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:22,989 INFO L225 Difference]: With dead ends: 556498 [2019-09-08 04:32:22,989 INFO L226 Difference]: Without dead ends: 414257 [2019-09-08 04:32:23,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:32:23,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414257 states. [2019-09-08 04:32:48,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414257 to 410670. [2019-09-08 04:32:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410670 states. [2019-09-08 04:32:50,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410670 states to 410670 states and 628224 transitions. [2019-09-08 04:32:50,207 INFO L78 Accepts]: Start accepts. Automaton has 410670 states and 628224 transitions. Word has length 280 [2019-09-08 04:32:50,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:50,208 INFO L475 AbstractCegarLoop]: Abstraction has 410670 states and 628224 transitions. [2019-09-08 04:32:50,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:32:50,208 INFO L276 IsEmpty]: Start isEmpty. Operand 410670 states and 628224 transitions. [2019-09-08 04:33:00,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-09-08 04:33:00,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:33:00,033 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:33:00,034 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:33:00,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:33:00,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1614954106, now seen corresponding path program 1 times [2019-09-08 04:33:00,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:33:00,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:33:00,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:00,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:33:00,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:00,251 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-08 04:33:00,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:33:00,251 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:33:00,268 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:33:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:00,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:33:00,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:33:00,901 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 04:33:00,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:33:00,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2019-09-08 04:33:00,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 04:33:00,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 04:33:00,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:33:00,913 INFO L87 Difference]: Start difference. First operand 410670 states and 628224 transitions. Second operand 18 states. [2019-09-08 04:33:23,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:33:23,890 INFO L93 Difference]: Finished difference Result 823468 states and 1260814 transitions. [2019-09-08 04:33:23,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 04:33:23,890 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 281 [2019-09-08 04:33:23,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:33:25,612 INFO L225 Difference]: With dead ends: 823468 [2019-09-08 04:33:25,612 INFO L226 Difference]: Without dead ends: 412910 [2019-09-08 04:33:26,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 04:33:26,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412910 states. [2019-09-08 04:33:58,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412910 to 411566. [2019-09-08 04:33:58,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411566 states. [2019-09-08 04:34:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411566 states to 411566 states and 629202 transitions. [2019-09-08 04:34:01,523 INFO L78 Accepts]: Start accepts. Automaton has 411566 states and 629202 transitions. Word has length 281 [2019-09-08 04:34:01,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:34:01,523 INFO L475 AbstractCegarLoop]: Abstraction has 411566 states and 629202 transitions. [2019-09-08 04:34:01,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 04:34:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 411566 states and 629202 transitions. [2019-09-08 04:34:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-08 04:34:04,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:34:04,168 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:34:04,168 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:34:04,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:34:04,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1783351334, now seen corresponding path program 1 times [2019-09-08 04:34:04,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:34:04,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:34:04,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:04,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:04,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:04,431 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-08 04:34:04,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:34:04,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 04:34:04,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 04:34:04,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 04:34:04,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:34:04,433 INFO L87 Difference]: Start difference. First operand 411566 states and 629202 transitions. Second operand 15 states. [2019-09-08 04:34:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:34:27,492 INFO L93 Difference]: Finished difference Result 661945 states and 968476 transitions. [2019-09-08 04:34:27,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 04:34:27,493 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 284 [2019-09-08 04:34:27,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:34:29,747 INFO L225 Difference]: With dead ends: 661945 [2019-09-08 04:34:29,747 INFO L226 Difference]: Without dead ends: 416958 [2019-09-08 04:34:30,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 04:34:30,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416958 states. [2019-09-08 04:35:00,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416958 to 407245. [2019-09-08 04:35:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407245 states. [2019-09-08 04:35:03,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407245 states to 407245 states and 622233 transitions. [2019-09-08 04:35:03,325 INFO L78 Accepts]: Start accepts. Automaton has 407245 states and 622233 transitions. Word has length 284 [2019-09-08 04:35:03,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:35:03,326 INFO L475 AbstractCegarLoop]: Abstraction has 407245 states and 622233 transitions. [2019-09-08 04:35:03,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 04:35:03,326 INFO L276 IsEmpty]: Start isEmpty. Operand 407245 states and 622233 transitions. [2019-09-08 04:35:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-09-08 04:35:04,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:35:04,190 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:35:04,191 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:35:04,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:35:04,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1595154731, now seen corresponding path program 1 times [2019-09-08 04:35:04,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:35:04,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:35:04,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:04,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:35:04,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:35:04,397 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 04:35:04,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:35:04,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:35:04,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:35:04,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:35:04,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:35:04,400 INFO L87 Difference]: Start difference. First operand 407245 states and 622233 transitions. Second operand 7 states. [2019-09-08 04:35:56,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:35:56,695 INFO L93 Difference]: Finished difference Result 1161892 states and 1798447 transitions. [2019-09-08 04:35:56,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:35:56,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 285 [2019-09-08 04:35:56,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:36:01,739 INFO L225 Difference]: With dead ends: 1161892 [2019-09-08 04:36:01,739 INFO L226 Difference]: Without dead ends: 915814 [2019-09-08 04:36:02,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:36:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915814 states. [2019-09-08 04:37:19,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915814 to 798067. [2019-09-08 04:37:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798067 states. [2019-09-08 04:37:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798067 states to 798067 states and 1231631 transitions. [2019-09-08 04:37:23,950 INFO L78 Accepts]: Start accepts. Automaton has 798067 states and 1231631 transitions. Word has length 285 [2019-09-08 04:37:23,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:37:23,951 INFO L475 AbstractCegarLoop]: Abstraction has 798067 states and 1231631 transitions. [2019-09-08 04:37:23,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:37:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 798067 states and 1231631 transitions.