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_spec8_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:59:59,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:59:59,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:59:59,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:59:59,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:59:59,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:59:59,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:59:59,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:59:59,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:59:59,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:59:59,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:59:59,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:59:59,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:59:59,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:59:59,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:59:59,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:59:59,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:59:59,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:59:59,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:59:59,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:59:59,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:59:59,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:59:59,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:59:59,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:59:59,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:59:59,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:59:59,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:59:59,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:59:59,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:59:59,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:59:59,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:59:59,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:59:59,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:59:59,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:59:59,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:59:59,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:59:59,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:59:59,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:59:59,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:59:59,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:59:59,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:59:59,541 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 13:59:59,556 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:59:59,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:59:59,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:59:59,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:59:59,558 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:59:59,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:59:59,558 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:59:59,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:59:59,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:59:59,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:59:59,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:59:59,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:59:59,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:59:59,559 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:59:59,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:59:59,560 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:59:59,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:59:59,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:59:59,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:59:59,561 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:59:59,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:59:59,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:59:59,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:59:59,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:59:59,562 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:59:59,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:59:59,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:59:59,562 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:59:59,563 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:59:59,613 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:59:59,631 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:59:59,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:59:59,639 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:59:59,639 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:59:59,640 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec8_product26.cil.c [2019-10-02 13:59:59,715 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88f7e9341/4c3306c661284668a001e1aa7a6b1a6b/FLAG157a6c21c [2019-10-02 14:00:00,358 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:00:00,359 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec8_product26.cil.c [2019-10-02 14:00:00,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88f7e9341/4c3306c661284668a001e1aa7a6b1a6b/FLAG157a6c21c [2019-10-02 14:00:00,534 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88f7e9341/4c3306c661284668a001e1aa7a6b1a6b [2019-10-02 14:00:00,546 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:00:00,549 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:00:00,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:00:00,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:00:00,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:00:00,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:00:00" (1/1) ... [2019-10-02 14:00:00,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5466f872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:00, skipping insertion in model container [2019-10-02 14:00:00,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:00:00" (1/1) ... [2019-10-02 14:00:00,564 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:00:00,646 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:00:01,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:00:01,433 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:00:01,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:00:01,706 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:00:01,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:01 WrapperNode [2019-10-02 14:00:01,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:00:01,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:00:01,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:00:01,709 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:00:01,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:01" (1/1) ... [2019-10-02 14:00:01,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:01" (1/1) ... [2019-10-02 14:00:01,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:01" (1/1) ... [2019-10-02 14:00:01,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:01" (1/1) ... [2019-10-02 14:00:01,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:01" (1/1) ... [2019-10-02 14:00:01,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:01" (1/1) ... [2019-10-02 14:00:01,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:01" (1/1) ... [2019-10-02 14:00:01,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:00:01,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:00:01,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:00:01,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:00:01,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:00:02,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:00:02,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:00:02,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 14:00:02,026 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 14:00:02,027 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 14:00:02,027 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 14:00:02,028 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 14:00:02,028 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 14:00:02,028 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 14:00:02,029 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 14:00:02,029 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 14:00:02,029 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 14:00:02,030 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:00:02,030 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 14:00:02,031 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 14:00:02,031 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 14:00:02,034 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 14:00:02,034 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 14:00:02,034 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 14:00:02,034 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 14:00:02,035 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 14:00:02,035 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 14:00:02,035 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 14:00:02,035 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 14:00:02,035 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 14:00:02,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-10-02 14:00:02,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-10-02 14:00:02,036 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 14:00:02,036 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 14:00:02,036 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 14:00:02,036 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 14:00:02,037 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 14:00:02,037 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 14:00:02,037 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-02 14:00:02,038 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 14:00:02,038 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 14:00:02,038 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 14:00:02,038 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 14:00:02,038 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 14:00:02,038 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 14:00:02,038 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 14:00:02,039 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 14:00:02,039 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 14:00:02,039 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 14:00:02,039 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 14:00:02,039 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 14:00:02,039 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 14:00:02,039 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 14:00:02,039 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 14:00:02,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 14:00:02,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 14:00:02,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 14:00:02,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 14:00:02,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 14:00:02,040 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 14:00:02,040 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 14:00:02,041 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 14:00:02,041 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 14:00:02,041 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 14:00:02,041 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 14:00:02,042 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 14:00:02,042 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 14:00:02,042 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 14:00:02,042 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 14:00:02,042 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 14:00:02,042 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 14:00:02,043 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 14:00:02,043 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 14:00:02,043 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 14:00:02,044 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 14:00:02,044 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 14:00:02,044 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 14:00:02,044 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 14:00:02,044 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 14:00:02,045 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 14:00:02,045 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 14:00:02,045 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 14:00:02,046 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 14:00:02,046 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 14:00:02,046 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 14:00:02,046 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 14:00:02,046 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 14:00:02,047 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 14:00:02,047 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 14:00:02,047 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 14:00:02,048 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 14:00:02,048 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 14:00:02,049 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 14:00:02,049 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 14:00:02,049 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 14:00:02,049 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 14:00:02,050 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 14:00:02,050 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 14:00:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 14:00:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 14:00:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 14:00:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 14:00:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 14:00:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 14:00:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 14:00:02,052 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 14:00:02,052 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 14:00:02,052 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 14:00:02,052 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 14:00:02,052 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 14:00:02,052 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 14:00:02,053 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 14:00:02,053 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 14:00:02,053 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 14:00:02,053 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 14:00:02,053 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 14:00:02,053 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 14:00:02,053 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 14:00:02,054 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 14:00:02,054 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 14:00:02,054 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 14:00:02,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:00:02,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:00:02,055 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 14:00:02,055 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 14:00:02,056 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 14:00:02,056 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 14:00:02,056 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 14:00:02,056 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 14:00:02,057 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 14:00:02,057 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 14:00:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 14:00:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 14:00:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 14:00:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 14:00:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 14:00:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 14:00:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 14:00:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 14:00:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 14:00:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 14:00:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 14:00:02,060 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 14:00:02,060 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 14:00:02,061 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 14:00:02,062 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 14:00:02,062 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 14:00:02,063 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 14:00:02,065 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 14:00:02,071 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 14:00:02,071 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 14:00:02,071 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 14:00:02,072 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 14:00:02,072 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:00:02,072 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 14:00:02,073 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 14:00:02,073 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 14:00:02,073 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 14:00:02,073 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 14:00:02,073 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 14:00:02,073 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 14:00:02,073 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 14:00:02,073 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 14:00:02,074 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 14:00:02,074 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 14:00:02,074 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 14:00:02,074 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 14:00:02,074 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 14:00:02,075 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 14:00:02,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 14:00:02,075 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 14:00:02,075 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 14:00:02,075 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-10-02 14:00:02,075 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-10-02 14:00:02,075 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 14:00:02,075 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 14:00:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 14:00:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 14:00:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 14:00:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 14:00:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 14:00:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 14:00:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 14:00:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 14:00:02,077 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 14:00:02,077 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 14:00:02,077 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 14:00:02,077 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 14:00:02,077 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 14:00:02,077 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 14:00:02,077 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 14:00:02,077 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 14:00:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 14:00:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 14:00:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 14:00:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 14:00:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 14:00:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 14:00:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 14:00:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 14:00:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 14:00:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 14:00:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 14:00:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-02 14:00:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 14:00:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 14:00:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 14:00:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 14:00:02,080 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 14:00:02,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 14:00:02,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 14:00:02,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 14:00:02,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 14:00:02,080 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 14:00:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 14:00:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 14:00:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 14:00:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 14:00:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 14:00:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 14:00:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 14:00:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 14:00:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 14:00:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 14:00:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 14:00:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 14:00:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 14:00:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 14:00:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 14:00:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 14:00:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 14:00:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 14:00:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 14:00:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 14:00:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 14:00:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 14:00:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 14:00:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 14:00:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 14:00:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 14:00:02,085 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 14:00:02,085 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 14:00:02,085 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 14:00:02,085 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 14:00:02,085 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 14:00:02,085 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 14:00:02,086 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 14:00:02,086 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 14:00:02,086 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 14:00:02,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:00:02,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 14:00:02,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:00:04,251 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:00:04,252 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 14:00:04,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:00:04 BoogieIcfgContainer [2019-10-02 14:00:04,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:00:04,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:00:04,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:00:04,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:00:04,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:00:00" (1/3) ... [2019-10-02 14:00:04,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518d8193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:00:04, skipping insertion in model container [2019-10-02 14:00:04,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:01" (2/3) ... [2019-10-02 14:00:04,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518d8193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:00:04, skipping insertion in model container [2019-10-02 14:00:04,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:00:04" (3/3) ... [2019-10-02 14:00:04,265 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_product26.cil.c [2019-10-02 14:00:04,276 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:00:04,293 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:00:04,312 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:00:04,347 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:00:04,348 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:00:04,348 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:00:04,348 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:00:04,349 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:00:04,349 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:00:04,349 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:00:04,349 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:00:04,349 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:00:04,391 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states. [2019-10-02 14:00:04,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 14:00:04,424 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:04,425 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:00:04,428 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:04,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:04,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1684965971, now seen corresponding path program 1 times [2019-10-02 14:00:04,436 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:04,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:04,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:04,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:04,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:00:05,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:00:05,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 14:00:05,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 14:00:05,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 14:00:05,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:00:05,201 INFO L87 Difference]: Start difference. First operand 605 states. Second operand 2 states. [2019-10-02 14:00:05,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:05,308 INFO L93 Difference]: Finished difference Result 885 states and 1196 transitions. [2019-10-02 14:00:05,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 14:00:05,310 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 154 [2019-10-02 14:00:05,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:05,348 INFO L225 Difference]: With dead ends: 885 [2019-10-02 14:00:05,348 INFO L226 Difference]: Without dead ends: 576 [2019-10-02 14:00:05,363 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:00:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-02 14:00:05,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-10-02 14:00:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-02 14:00:05,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 784 transitions. [2019-10-02 14:00:05,487 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 784 transitions. Word has length 154 [2019-10-02 14:00:05,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:05,490 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 784 transitions. [2019-10-02 14:00:05,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 14:00:05,490 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 784 transitions. [2019-10-02 14:00:05,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 14:00:05,495 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:05,496 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:00:05,496 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:05,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:05,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1215749275, now seen corresponding path program 1 times [2019-10-02 14:00:05,497 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:05,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:05,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:05,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:05,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:05,775 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:00:05,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:00:05,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:00:05,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:00:05,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:00:05,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:05,782 INFO L87 Difference]: Start difference. First operand 576 states and 784 transitions. Second operand 3 states. [2019-10-02 14:00:05,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:05,861 INFO L93 Difference]: Finished difference Result 868 states and 1162 transitions. [2019-10-02 14:00:05,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:00:05,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-02 14:00:05,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:05,875 INFO L225 Difference]: With dead ends: 868 [2019-10-02 14:00:05,875 INFO L226 Difference]: Without dead ends: 579 [2019-10-02 14:00:05,878 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:05,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-10-02 14:00:05,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 578. [2019-10-02 14:00:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-02 14:00:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 786 transitions. [2019-10-02 14:00:05,917 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 786 transitions. Word has length 155 [2019-10-02 14:00:05,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:05,918 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 786 transitions. [2019-10-02 14:00:05,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:00:05,918 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 786 transitions. [2019-10-02 14:00:05,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 14:00:05,922 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:05,922 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:00:05,922 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:05,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:05,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1775436074, now seen corresponding path program 1 times [2019-10-02 14:00:05,923 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:05,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:05,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:05,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:05,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:06,136 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:00:06,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:00:06,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:00:06,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:00:06,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:00:06,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:06,144 INFO L87 Difference]: Start difference. First operand 578 states and 786 transitions. Second operand 3 states. [2019-10-02 14:00:06,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:06,225 INFO L93 Difference]: Finished difference Result 1136 states and 1576 transitions. [2019-10-02 14:00:06,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:00:06,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-10-02 14:00:06,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:06,239 INFO L225 Difference]: With dead ends: 1136 [2019-10-02 14:00:06,239 INFO L226 Difference]: Without dead ends: 623 [2019-10-02 14:00:06,243 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:06,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-02 14:00:06,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 622. [2019-10-02 14:00:06,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-10-02 14:00:06,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 861 transitions. [2019-10-02 14:00:06,309 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 861 transitions. Word has length 167 [2019-10-02 14:00:06,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:06,310 INFO L475 AbstractCegarLoop]: Abstraction has 622 states and 861 transitions. [2019-10-02 14:00:06,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:00:06,311 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 861 transitions. [2019-10-02 14:00:06,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 14:00:06,320 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:06,321 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:00:06,321 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:06,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:06,322 INFO L82 PathProgramCache]: Analyzing trace with hash -309868390, now seen corresponding path program 1 times [2019-10-02 14:00:06,322 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:06,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:06,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:06,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:06,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:00:06,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:00:06,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:00:06,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:00:06,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:00:06,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:06,588 INFO L87 Difference]: Start difference. First operand 622 states and 861 transitions. Second operand 3 states. [2019-10-02 14:00:06,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:06,635 INFO L93 Difference]: Finished difference Result 1265 states and 1796 transitions. [2019-10-02 14:00:06,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:00:06,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-02 14:00:06,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:06,641 INFO L225 Difference]: With dead ends: 1265 [2019-10-02 14:00:06,641 INFO L226 Difference]: Without dead ends: 708 [2019-10-02 14:00:06,644 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:06,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-10-02 14:00:06,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 707. [2019-10-02 14:00:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-10-02 14:00:06,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1005 transitions. [2019-10-02 14:00:06,681 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1005 transitions. Word has length 168 [2019-10-02 14:00:06,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:06,681 INFO L475 AbstractCegarLoop]: Abstraction has 707 states and 1005 transitions. [2019-10-02 14:00:06,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:00:06,682 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1005 transitions. [2019-10-02 14:00:06,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 14:00:06,687 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:06,687 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:00:06,688 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:06,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:06,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1506712822, now seen corresponding path program 1 times [2019-10-02 14:00:06,688 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:06,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:06,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:06,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:06,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:06,867 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:00:06,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:00:06,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:00:06,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:00:06,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:00:06,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:06,869 INFO L87 Difference]: Start difference. First operand 707 states and 1005 transitions. Second operand 3 states. [2019-10-02 14:00:06,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:06,921 INFO L93 Difference]: Finished difference Result 1514 states and 2218 transitions. [2019-10-02 14:00:06,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:00:06,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-10-02 14:00:06,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:06,928 INFO L225 Difference]: With dead ends: 1514 [2019-10-02 14:00:06,928 INFO L226 Difference]: Without dead ends: 872 [2019-10-02 14:00:06,932 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:06,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2019-10-02 14:00:06,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 871. [2019-10-02 14:00:06,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2019-10-02 14:00:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1281 transitions. [2019-10-02 14:00:06,977 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1281 transitions. Word has length 169 [2019-10-02 14:00:06,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:06,978 INFO L475 AbstractCegarLoop]: Abstraction has 871 states and 1281 transitions. [2019-10-02 14:00:06,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:00:06,978 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1281 transitions. [2019-10-02 14:00:06,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 14:00:06,985 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:06,985 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:00:06,985 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:06,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:06,986 INFO L82 PathProgramCache]: Analyzing trace with hash 43767191, now seen corresponding path program 1 times [2019-10-02 14:00:06,986 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:06,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:06,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:06,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:06,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:07,328 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 14:00:07,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:00:07,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:00:07,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:00:07,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:00:07,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:07,330 INFO L87 Difference]: Start difference. First operand 871 states and 1281 transitions. Second operand 3 states. [2019-10-02 14:00:07,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:07,376 INFO L93 Difference]: Finished difference Result 1261 states and 1810 transitions. [2019-10-02 14:00:07,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:00:07,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-10-02 14:00:07,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:07,383 INFO L225 Difference]: With dead ends: 1261 [2019-10-02 14:00:07,383 INFO L226 Difference]: Without dead ends: 985 [2019-10-02 14:00:07,385 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:07,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2019-10-02 14:00:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 984. [2019-10-02 14:00:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-10-02 14:00:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1443 transitions. [2019-10-02 14:00:07,429 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1443 transitions. Word has length 171 [2019-10-02 14:00:07,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:07,430 INFO L475 AbstractCegarLoop]: Abstraction has 984 states and 1443 transitions. [2019-10-02 14:00:07,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:00:07,430 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1443 transitions. [2019-10-02 14:00:07,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-02 14:00:07,439 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:07,439 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:00:07,439 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:07,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:07,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1934700536, now seen corresponding path program 1 times [2019-10-02 14:00:07,440 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:07,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:07,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:07,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:07,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 14:00:07,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:00:07,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:00:07,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:00:07,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:00:07,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:00:07,750 INFO L87 Difference]: Start difference. First operand 984 states and 1443 transitions. Second operand 6 states. [2019-10-02 14:00:08,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:08,538 INFO L93 Difference]: Finished difference Result 2297 states and 3345 transitions. [2019-10-02 14:00:08,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:00:08,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 306 [2019-10-02 14:00:08,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:08,552 INFO L225 Difference]: With dead ends: 2297 [2019-10-02 14:00:08,553 INFO L226 Difference]: Without dead ends: 1919 [2019-10-02 14:00:08,555 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:00:08,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2019-10-02 14:00:08,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1908. [2019-10-02 14:00:08,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1908 states. [2019-10-02 14:00:08,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2828 transitions. [2019-10-02 14:00:08,666 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2828 transitions. Word has length 306 [2019-10-02 14:00:08,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:08,668 INFO L475 AbstractCegarLoop]: Abstraction has 1908 states and 2828 transitions. [2019-10-02 14:00:08,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:00:08,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2828 transitions. [2019-10-02 14:00:08,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-10-02 14:00:08,682 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:08,684 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:00:08,684 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:08,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:08,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1767300773, now seen corresponding path program 1 times [2019-10-02 14:00:08,685 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:08,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:08,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:08,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:08,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 14:00:09,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:00:09,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:00:09,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:00:09,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:00:09,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:00:09,018 INFO L87 Difference]: Start difference. First operand 1908 states and 2828 transitions. Second operand 9 states. [2019-10-02 14:00:09,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:09,389 INFO L93 Difference]: Finished difference Result 2661 states and 3825 transitions. [2019-10-02 14:00:09,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:00:09,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 307 [2019-10-02 14:00:09,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:09,403 INFO L225 Difference]: With dead ends: 2661 [2019-10-02 14:00:09,403 INFO L226 Difference]: Without dead ends: 1882 [2019-10-02 14:00:09,407 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:00:09,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2019-10-02 14:00:09,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1878. [2019-10-02 14:00:09,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1878 states. [2019-10-02 14:00:09,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2777 transitions. [2019-10-02 14:00:09,504 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2777 transitions. Word has length 307 [2019-10-02 14:00:09,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:09,504 INFO L475 AbstractCegarLoop]: Abstraction has 1878 states and 2777 transitions. [2019-10-02 14:00:09,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:00:09,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2777 transitions. [2019-10-02 14:00:09,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-02 14:00:09,516 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:09,517 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:00:09,517 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:09,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:09,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1453025090, now seen corresponding path program 1 times [2019-10-02 14:00:09,518 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:09,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:09,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:09,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:09,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 14:00:09,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:00:09,996 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:00:10,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:10,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 3421 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:00:10,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:00:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-10-02 14:00:11,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:00:11,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2019-10-02 14:00:11,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:00:11,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:00:11,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:00:11,204 INFO L87 Difference]: Start difference. First operand 1878 states and 2777 transitions. Second operand 29 states. [2019-10-02 14:00:55,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:55,346 INFO L93 Difference]: Finished difference Result 10646 states and 15939 transitions. [2019-10-02 14:00:55,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-10-02 14:00:55,347 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 300 [2019-10-02 14:00:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:55,407 INFO L225 Difference]: With dead ends: 10646 [2019-10-02 14:00:55,407 INFO L226 Difference]: Without dead ends: 8598 [2019-10-02 14:00:55,429 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10439 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2054, Invalid=28048, Unknown=0, NotChecked=0, Total=30102 [2019-10-02 14:00:55,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8598 states. [2019-10-02 14:00:55,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8598 to 8200. [2019-10-02 14:00:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8200 states. [2019-10-02 14:00:56,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8200 states to 8200 states and 12067 transitions. [2019-10-02 14:00:56,010 INFO L78 Accepts]: Start accepts. Automaton has 8200 states and 12067 transitions. Word has length 300 [2019-10-02 14:00:56,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:56,010 INFO L475 AbstractCegarLoop]: Abstraction has 8200 states and 12067 transitions. [2019-10-02 14:00:56,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:00:56,011 INFO L276 IsEmpty]: Start isEmpty. Operand 8200 states and 12067 transitions. [2019-10-02 14:00:56,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-02 14:00:56,042 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:56,043 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-02 14:00:56,043 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:56,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:56,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1795472371, now seen corresponding path program 1 times [2019-10-02 14:00:56,044 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:56,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:56,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:56,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:56,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-02 14:00:56,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:00:56,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:00:56,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:00:56,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:00:56,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:00:56,313 INFO L87 Difference]: Start difference. First operand 8200 states and 12067 transitions. Second operand 5 states. [2019-10-02 14:00:57,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:57,111 INFO L93 Difference]: Finished difference Result 13847 states and 19980 transitions. [2019-10-02 14:00:57,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:00:57,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 306 [2019-10-02 14:00:57,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:57,177 INFO L225 Difference]: With dead ends: 13847 [2019-10-02 14:00:57,177 INFO L226 Difference]: Without dead ends: 7767 [2019-10-02 14:00:57,208 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:00:57,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7767 states. [2019-10-02 14:00:57,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7767 to 7693. [2019-10-02 14:00:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7693 states. [2019-10-02 14:00:57,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7693 states to 7693 states and 11316 transitions. [2019-10-02 14:00:57,698 INFO L78 Accepts]: Start accepts. Automaton has 7693 states and 11316 transitions. Word has length 306 [2019-10-02 14:00:57,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:57,699 INFO L475 AbstractCegarLoop]: Abstraction has 7693 states and 11316 transitions. [2019-10-02 14:00:57,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:00:57,699 INFO L276 IsEmpty]: Start isEmpty. Operand 7693 states and 11316 transitions. [2019-10-02 14:00:57,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-10-02 14:00:57,729 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:57,730 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:00:57,730 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:57,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:57,731 INFO L82 PathProgramCache]: Analyzing trace with hash -115878542, now seen corresponding path program 1 times [2019-10-02 14:00:57,731 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:57,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:57,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:57,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:57,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 14:00:58,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:00:58,145 INFO L224 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-10-02 14:00:58,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:58,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 3423 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:00:58,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:00:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-10-02 14:00:59,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:00:59,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2019-10-02 14:00:59,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 14:00:59,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 14:00:59,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-10-02 14:00:59,181 INFO L87 Difference]: Start difference. First operand 7693 states and 11316 transitions. Second operand 21 states. [2019-10-02 14:01:02,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:01:02,020 INFO L93 Difference]: Finished difference Result 16013 states and 24215 transitions. [2019-10-02 14:01:02,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 14:01:02,020 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 302 [2019-10-02 14:01:02,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:01:02,067 INFO L225 Difference]: With dead ends: 16013 [2019-10-02 14:01:02,067 INFO L226 Difference]: Without dead ends: 8205 [2019-10-02 14:01:02,113 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=1499, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:01:02,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8205 states. [2019-10-02 14:01:02,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8205 to 8163. [2019-10-02 14:01:02,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8163 states. [2019-10-02 14:01:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8163 states to 8163 states and 12094 transitions. [2019-10-02 14:01:02,530 INFO L78 Accepts]: Start accepts. Automaton has 8163 states and 12094 transitions. Word has length 302 [2019-10-02 14:01:02,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:01:02,531 INFO L475 AbstractCegarLoop]: Abstraction has 8163 states and 12094 transitions. [2019-10-02 14:01:02,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 14:01:02,531 INFO L276 IsEmpty]: Start isEmpty. Operand 8163 states and 12094 transitions. [2019-10-02 14:01:02,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-10-02 14:01:02,562 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:01:02,562 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:01:02,563 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:01:02,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:01:02,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1139678498, now seen corresponding path program 1 times [2019-10-02 14:01:02,563 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:01:02,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:01:02,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:02,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:02,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 14:01:03,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:01:03,009 INFO L224 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-10-02 14:01:03,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:03,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 3426 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:01:03,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:01:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 14:01:04,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:01:04,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-10-02 14:01:04,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 14:01:04,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 14:01:04,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:01:04,041 INFO L87 Difference]: Start difference. First operand 8163 states and 12094 transitions. Second operand 25 states. [2019-10-02 14:01:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:01:44,502 INFO L93 Difference]: Finished difference Result 23485 states and 34933 transitions. [2019-10-02 14:01:44,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-10-02 14:01:44,503 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 305 [2019-10-02 14:01:44,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:01:44,560 INFO L225 Difference]: With dead ends: 23485 [2019-10-02 14:01:44,560 INFO L226 Difference]: Without dead ends: 12963 [2019-10-02 14:01:44,618 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9508 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1939, Invalid=25451, Unknown=0, NotChecked=0, Total=27390 [2019-10-02 14:01:44,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12963 states. [2019-10-02 14:01:45,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12963 to 11669. [2019-10-02 14:01:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11669 states. [2019-10-02 14:01:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11669 states to 11669 states and 17188 transitions. [2019-10-02 14:01:45,249 INFO L78 Accepts]: Start accepts. Automaton has 11669 states and 17188 transitions. Word has length 305 [2019-10-02 14:01:45,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:01:45,251 INFO L475 AbstractCegarLoop]: Abstraction has 11669 states and 17188 transitions. [2019-10-02 14:01:45,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 14:01:45,251 INFO L276 IsEmpty]: Start isEmpty. Operand 11669 states and 17188 transitions. [2019-10-02 14:01:45,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-10-02 14:01:45,283 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:01:45,284 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:01:45,284 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:01:45,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:01:45,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1903400372, now seen corresponding path program 1 times [2019-10-02 14:01:45,285 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:01:45,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:01:45,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:45,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:45,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:45,816 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 14:01:45,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:01:45,816 INFO L224 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:01:45,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:46,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 3426 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:01:46,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:01:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 14:01:46,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:01:46,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-10-02 14:01:46,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 14:01:46,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 14:01:46,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:01:46,685 INFO L87 Difference]: Start difference. First operand 11669 states and 17188 transitions. Second operand 25 states. [2019-10-02 14:02:27,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:02:27,384 INFO L93 Difference]: Finished difference Result 32008 states and 47402 transitions. [2019-10-02 14:02:27,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-10-02 14:02:27,384 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 305 [2019-10-02 14:02:27,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:02:27,458 INFO L225 Difference]: With dead ends: 32008 [2019-10-02 14:02:27,459 INFO L226 Difference]: Without dead ends: 16740 [2019-10-02 14:02:27,501 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9422 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1939, Invalid=25451, Unknown=0, NotChecked=0, Total=27390 [2019-10-02 14:02:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16740 states. [2019-10-02 14:02:28,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16740 to 14579. [2019-10-02 14:02:28,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14579 states. [2019-10-02 14:02:28,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14579 states to 14579 states and 21387 transitions. [2019-10-02 14:02:28,326 INFO L78 Accepts]: Start accepts. Automaton has 14579 states and 21387 transitions. Word has length 305 [2019-10-02 14:02:28,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:02:28,326 INFO L475 AbstractCegarLoop]: Abstraction has 14579 states and 21387 transitions. [2019-10-02 14:02:28,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 14:02:28,327 INFO L276 IsEmpty]: Start isEmpty. Operand 14579 states and 21387 transitions. [2019-10-02 14:02:28,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-02 14:02:28,369 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:02:28,370 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:02:28,370 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:02:28,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:02:28,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1758332928, now seen corresponding path program 1 times [2019-10-02 14:02:28,371 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:02:28,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:02:28,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:02:28,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:02:28,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:02:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:02:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 14:02:28,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:02:28,910 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:02:29,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:02:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:02:29,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 3425 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:02:29,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:02:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 14:02:30,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:02:30,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [26] total 31 [2019-10-02 14:02:30,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 14:02:30,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 14:02:30,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=862, Unknown=0, NotChecked=0, Total=930 [2019-10-02 14:02:30,028 INFO L87 Difference]: Start difference. First operand 14579 states and 21387 transitions. Second operand 31 states. [2019-10-02 14:03:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:03:19,260 INFO L93 Difference]: Finished difference Result 56329 states and 85150 transitions. [2019-10-02 14:03:19,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2019-10-02 14:03:19,260 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 308 [2019-10-02 14:03:19,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:03:19,390 INFO L225 Difference]: With dead ends: 56329 [2019-10-02 14:03:19,391 INFO L226 Difference]: Without dead ends: 35756 [2019-10-02 14:03:19,466 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21052 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2983, Invalid=53423, Unknown=0, NotChecked=0, Total=56406 [2019-10-02 14:03:19,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35756 states. [2019-10-02 14:03:20,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35756 to 31691. [2019-10-02 14:03:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31691 states. [2019-10-02 14:03:20,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31691 states to 31691 states and 47051 transitions. [2019-10-02 14:03:20,894 INFO L78 Accepts]: Start accepts. Automaton has 31691 states and 47051 transitions. Word has length 308 [2019-10-02 14:03:20,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:03:20,894 INFO L475 AbstractCegarLoop]: Abstraction has 31691 states and 47051 transitions. [2019-10-02 14:03:20,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 14:03:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 31691 states and 47051 transitions. [2019-10-02 14:03:20,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-02 14:03:20,909 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:03:20,910 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-02 14:03:20,910 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:03:20,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:03:20,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1699739140, now seen corresponding path program 1 times [2019-10-02 14:03:20,911 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:03:20,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:03:20,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:20,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:03:20,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:03:21,219 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 14:03:21,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:03:21,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 14:03:21,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:03:21,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:03:21,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:03:21,222 INFO L87 Difference]: Start difference. First operand 31691 states and 47051 transitions. Second operand 11 states. [2019-10-02 14:03:21,565 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-10-02 14:03:22,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:03:22,335 INFO L93 Difference]: Finished difference Result 60874 states and 92086 transitions. [2019-10-02 14:03:22,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:03:22,335 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 308 [2019-10-02 14:03:22,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:03:22,475 INFO L225 Difference]: With dead ends: 60874 [2019-10-02 14:03:22,475 INFO L226 Difference]: Without dead ends: 33335 [2019-10-02 14:03:22,548 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:03:22,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33335 states. [2019-10-02 14:03:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33335 to 33048. [2019-10-02 14:03:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33048 states. [2019-10-02 14:03:23,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33048 states to 33048 states and 49289 transitions. [2019-10-02 14:03:23,630 INFO L78 Accepts]: Start accepts. Automaton has 33048 states and 49289 transitions. Word has length 308 [2019-10-02 14:03:23,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:03:23,630 INFO L475 AbstractCegarLoop]: Abstraction has 33048 states and 49289 transitions. [2019-10-02 14:03:23,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:03:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 33048 states and 49289 transitions. [2019-10-02 14:03:23,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-02 14:03:23,649 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:03:23,650 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:03:23,650 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:03:23,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:03:23,650 INFO L82 PathProgramCache]: Analyzing trace with hash -490523009, now seen corresponding path program 1 times [2019-10-02 14:03:23,650 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:03:23,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:03:23,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:23,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:03:23,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:03:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 14:03:23,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:03:23,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 14:03:23,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:03:23,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:03:23,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:03:23,946 INFO L87 Difference]: Start difference. First operand 33048 states and 49289 transitions. Second operand 11 states. [2019-10-02 14:03:25,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:03:25,071 INFO L93 Difference]: Finished difference Result 63511 states and 96466 transitions. [2019-10-02 14:03:25,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:03:25,072 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 310 [2019-10-02 14:03:25,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:03:25,207 INFO L225 Difference]: With dead ends: 63511 [2019-10-02 14:03:25,207 INFO L226 Difference]: Without dead ends: 34615 [2019-10-02 14:03:25,282 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:03:25,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34615 states. [2019-10-02 14:03:26,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34615 to 34391. [2019-10-02 14:03:26,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34391 states. [2019-10-02 14:03:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34391 states to 34391 states and 51485 transitions. [2019-10-02 14:03:26,341 INFO L78 Accepts]: Start accepts. Automaton has 34391 states and 51485 transitions. Word has length 310 [2019-10-02 14:03:26,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:03:26,342 INFO L475 AbstractCegarLoop]: Abstraction has 34391 states and 51485 transitions. [2019-10-02 14:03:26,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:03:26,342 INFO L276 IsEmpty]: Start isEmpty. Operand 34391 states and 51485 transitions. [2019-10-02 14:03:26,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-02 14:03:26,361 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:03:26,362 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:03:26,362 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:03:26,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:03:26,362 INFO L82 PathProgramCache]: Analyzing trace with hash -815132905, now seen corresponding path program 1 times [2019-10-02 14:03:26,363 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:03:26,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:03:26,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:26,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:03:26,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:03:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 14:03:26,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:03:26,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:03:26,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:03:26,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:03:26,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:03:26,593 INFO L87 Difference]: Start difference. First operand 34391 states and 51485 transitions. Second operand 5 states. [2019-10-02 14:03:27,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:03:27,995 INFO L93 Difference]: Finished difference Result 64992 states and 99266 transitions. [2019-10-02 14:03:27,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:03:27,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 311 [2019-10-02 14:03:27,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:03:28,097 INFO L225 Difference]: With dead ends: 64992 [2019-10-02 14:03:28,097 INFO L226 Difference]: Without dead ends: 34427 [2019-10-02 14:03:28,149 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:03:28,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34427 states. [2019-10-02 14:03:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34427 to 34407. [2019-10-02 14:03:29,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34407 states. [2019-10-02 14:03:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34407 states to 34407 states and 51450 transitions. [2019-10-02 14:03:29,225 INFO L78 Accepts]: Start accepts. Automaton has 34407 states and 51450 transitions. Word has length 311 [2019-10-02 14:03:29,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:03:29,226 INFO L475 AbstractCegarLoop]: Abstraction has 34407 states and 51450 transitions. [2019-10-02 14:03:29,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:03:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 34407 states and 51450 transitions. [2019-10-02 14:03:29,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-02 14:03:29,249 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:03:29,250 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-02 14:03:29,250 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:03:29,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:03:29,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1259555783, now seen corresponding path program 1 times [2019-10-02 14:03:29,250 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:03:29,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:03:29,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:29,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:03:29,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:03:29,429 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 14:03:29,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:03:29,430 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:03:29,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:03:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:03:30,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 3424 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:03:30,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:03:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 14:03:30,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:03:30,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-10-02 14:03:30,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:03:30,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:03:30,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:03:30,217 INFO L87 Difference]: Start difference. First operand 34407 states and 51450 transitions. Second operand 10 states. [2019-10-02 14:03:35,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:03:35,423 INFO L93 Difference]: Finished difference Result 105624 states and 158365 transitions. [2019-10-02 14:03:35,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 14:03:35,424 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 306 [2019-10-02 14:03:35,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:03:35,676 INFO L225 Difference]: With dead ends: 105624 [2019-10-02 14:03:35,676 INFO L226 Difference]: Without dead ends: 71027 [2019-10-02 14:03:35,777 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-10-02 14:03:35,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71027 states. [2019-10-02 14:03:40,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71027 to 70420. [2019-10-02 14:03:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70420 states. [2019-10-02 14:03:40,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70420 states to 70420 states and 105329 transitions. [2019-10-02 14:03:40,522 INFO L78 Accepts]: Start accepts. Automaton has 70420 states and 105329 transitions. Word has length 306 [2019-10-02 14:03:40,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:03:40,523 INFO L475 AbstractCegarLoop]: Abstraction has 70420 states and 105329 transitions. [2019-10-02 14:03:40,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:03:40,523 INFO L276 IsEmpty]: Start isEmpty. Operand 70420 states and 105329 transitions. [2019-10-02 14:03:40,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-10-02 14:03:40,548 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:03:40,548 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:03:40,548 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:03:40,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:03:40,549 INFO L82 PathProgramCache]: Analyzing trace with hash 216410705, now seen corresponding path program 1 times [2019-10-02 14:03:40,549 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:03:40,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:03:40,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:40,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:03:40,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:03:40,809 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 14:03:40,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:03:40,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 14:03:40,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 14:03:40,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 14:03:40,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:03:40,811 INFO L87 Difference]: Start difference. First operand 70420 states and 105329 transitions. Second operand 13 states. [2019-10-02 14:03:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:03:49,369 INFO L93 Difference]: Finished difference Result 205909 states and 320964 transitions. [2019-10-02 14:03:49,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:03:49,369 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 307 [2019-10-02 14:03:49,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:03:49,876 INFO L225 Difference]: With dead ends: 205909 [2019-10-02 14:03:49,876 INFO L226 Difference]: Without dead ends: 140274 [2019-10-02 14:03:50,080 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:03:50,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140274 states. [2019-10-02 14:03:54,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140274 to 139546. [2019-10-02 14:03:54,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139546 states. [2019-10-02 14:03:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139546 states to 139546 states and 208213 transitions. [2019-10-02 14:03:55,471 INFO L78 Accepts]: Start accepts. Automaton has 139546 states and 208213 transitions. Word has length 307 [2019-10-02 14:03:55,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:03:55,471 INFO L475 AbstractCegarLoop]: Abstraction has 139546 states and 208213 transitions. [2019-10-02 14:03:55,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 14:03:55,472 INFO L276 IsEmpty]: Start isEmpty. Operand 139546 states and 208213 transitions. [2019-10-02 14:03:55,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-02 14:03:55,516 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:03:55,517 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:03:55,517 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:03:55,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:03:55,517 INFO L82 PathProgramCache]: Analyzing trace with hash -307195635, now seen corresponding path program 1 times [2019-10-02 14:03:55,517 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:03:55,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:03:55,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:55,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:03:55,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:03:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 14:03:59,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:03:59,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:03:59,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:03:59,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:03:59,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:03:59,372 INFO L87 Difference]: Start difference. First operand 139546 states and 208213 transitions. Second operand 3 states. [2019-10-02 14:04:03,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:04:03,186 INFO L93 Difference]: Finished difference Result 282807 states and 423177 transitions. [2019-10-02 14:04:03,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:04:03,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-10-02 14:04:03,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:04:03,664 INFO L225 Difference]: With dead ends: 282807 [2019-10-02 14:04:03,664 INFO L226 Difference]: Without dead ends: 143350 [2019-10-02 14:04:03,905 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:04:04,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143350 states. [2019-10-02 14:04:10,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143350 to 143338. [2019-10-02 14:04:10,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143338 states. [2019-10-02 14:04:10,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143338 states to 143338 states and 214957 transitions. [2019-10-02 14:04:10,751 INFO L78 Accepts]: Start accepts. Automaton has 143338 states and 214957 transitions. Word has length 308 [2019-10-02 14:04:10,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:04:10,752 INFO L475 AbstractCegarLoop]: Abstraction has 143338 states and 214957 transitions. [2019-10-02 14:04:10,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:04:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 143338 states and 214957 transitions. [2019-10-02 14:04:10,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-10-02 14:04:10,830 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:04:10,830 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:04:10,831 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:04:10,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:04:10,831 INFO L82 PathProgramCache]: Analyzing trace with hash -321002755, now seen corresponding path program 1 times [2019-10-02 14:04:10,831 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:04:10,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:04:10,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:10,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:04:10,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:04:11,008 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 14:04:11,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:04:11,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:04:11,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:04:11,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:04:11,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:04:11,010 INFO L87 Difference]: Start difference. First operand 143338 states and 214957 transitions. Second operand 9 states. [2019-10-02 14:04:19,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:04:19,443 INFO L93 Difference]: Finished difference Result 284543 states and 443326 transitions. [2019-10-02 14:04:19,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:04:19,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 309 [2019-10-02 14:04:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:04:19,954 INFO L225 Difference]: With dead ends: 284543 [2019-10-02 14:04:19,954 INFO L226 Difference]: Without dead ends: 149846 [2019-10-02 14:04:20,204 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:04:20,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149846 states. [2019-10-02 14:04:28,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149846 to 148073. [2019-10-02 14:04:28,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148073 states. [2019-10-02 14:04:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148073 states to 148073 states and 223173 transitions. [2019-10-02 14:04:29,094 INFO L78 Accepts]: Start accepts. Automaton has 148073 states and 223173 transitions. Word has length 309 [2019-10-02 14:04:29,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:04:29,095 INFO L475 AbstractCegarLoop]: Abstraction has 148073 states and 223173 transitions. [2019-10-02 14:04:29,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:04:29,095 INFO L276 IsEmpty]: Start isEmpty. Operand 148073 states and 223173 transitions. [2019-10-02 14:04:29,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-02 14:04:29,153 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:04:29,153 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-02 14:04:29,153 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:04:29,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:04:29,153 INFO L82 PathProgramCache]: Analyzing trace with hash -195825121, now seen corresponding path program 1 times [2019-10-02 14:04:29,153 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:04:29,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:04:29,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:29,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:04:29,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:04:29,375 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 14:04:29,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:04:29,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 14:04:29,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:04:29,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:04:29,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:04:29,376 INFO L87 Difference]: Start difference. First operand 148073 states and 223173 transitions. Second operand 11 states. [2019-10-02 14:04:43,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:04:43,538 INFO L93 Difference]: Finished difference Result 309772 states and 467363 transitions. [2019-10-02 14:04:43,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:04:43,540 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 308 [2019-10-02 14:04:43,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:04:44,286 INFO L225 Difference]: With dead ends: 309772 [2019-10-02 14:04:44,286 INFO L226 Difference]: Without dead ends: 189212 [2019-10-02 14:04:44,603 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:04:44,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189212 states. [2019-10-02 14:04:53,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189212 to 180380. [2019-10-02 14:04:53,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180380 states. [2019-10-02 14:04:54,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180380 states to 180380 states and 273562 transitions. [2019-10-02 14:04:54,163 INFO L78 Accepts]: Start accepts. Automaton has 180380 states and 273562 transitions. Word has length 308 [2019-10-02 14:04:54,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:04:54,164 INFO L475 AbstractCegarLoop]: Abstraction has 180380 states and 273562 transitions. [2019-10-02 14:04:54,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:04:54,164 INFO L276 IsEmpty]: Start isEmpty. Operand 180380 states and 273562 transitions. [2019-10-02 14:04:54,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-10-02 14:04:54,238 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:04:54,239 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-02 14:04:54,239 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:04:54,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:04:54,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1028276773, now seen corresponding path program 1 times [2019-10-02 14:04:54,239 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:04:54,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:04:54,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:54,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:04:54,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:04:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 14:04:54,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:04:54,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:04:54,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:04:54,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:04:54,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:04:54,421 INFO L87 Difference]: Start difference. First operand 180380 states and 273562 transitions. Second operand 3 states. [2019-10-02 14:05:08,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:05:08,265 INFO L93 Difference]: Finished difference Result 367979 states and 560043 transitions. [2019-10-02 14:05:08,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:05:08,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 357 [2019-10-02 14:05:08,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:05:09,098 INFO L225 Difference]: With dead ends: 367979 [2019-10-02 14:05:09,099 INFO L226 Difference]: Without dead ends: 187688 [2019-10-02 14:05:09,463 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:05:09,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187688 states. [2019-10-02 14:05:16,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187688 to 187676. [2019-10-02 14:05:16,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187676 states. [2019-10-02 14:05:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187676 states to 187676 states and 286378 transitions. [2019-10-02 14:05:18,074 INFO L78 Accepts]: Start accepts. Automaton has 187676 states and 286378 transitions. Word has length 357 [2019-10-02 14:05:18,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:05:18,074 INFO L475 AbstractCegarLoop]: Abstraction has 187676 states and 286378 transitions. [2019-10-02 14:05:18,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:05:18,074 INFO L276 IsEmpty]: Start isEmpty. Operand 187676 states and 286378 transitions. [2019-10-02 14:05:18,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-10-02 14:05:18,158 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:05:18,158 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:05:18,159 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:05:18,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:05:18,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1382246828, now seen corresponding path program 1 times [2019-10-02 14:05:18,159 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:05:18,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:05:18,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:18,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:05:18,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:05:18,324 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-02 14:05:18,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:05:18,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:05:18,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:05:18,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:05:18,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:05:18,325 INFO L87 Difference]: Start difference. First operand 187676 states and 286378 transitions. Second operand 3 states. [2019-10-02 14:05:29,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:05:29,525 INFO L93 Difference]: Finished difference Result 389291 states and 597723 transitions. [2019-10-02 14:05:29,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:05:29,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 361 [2019-10-02 14:05:29,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:05:30,898 INFO L225 Difference]: With dead ends: 389291 [2019-10-02 14:05:30,898 INFO L226 Difference]: Without dead ends: 201704 [2019-10-02 14:05:31,201 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:05:31,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201704 states. [2019-10-02 14:05:43,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201704 to 201692. [2019-10-02 14:05:43,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201692 states. [2019-10-02 14:05:44,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201692 states to 201692 states and 311050 transitions. [2019-10-02 14:05:44,140 INFO L78 Accepts]: Start accepts. Automaton has 201692 states and 311050 transitions. Word has length 361 [2019-10-02 14:05:44,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:05:44,140 INFO L475 AbstractCegarLoop]: Abstraction has 201692 states and 311050 transitions. [2019-10-02 14:05:44,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:05:44,140 INFO L276 IsEmpty]: Start isEmpty. Operand 201692 states and 311050 transitions. [2019-10-02 14:05:44,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-10-02 14:05:44,273 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:05:44,273 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:05:44,273 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:05:44,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:05:44,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1851337995, now seen corresponding path program 1 times [2019-10-02 14:05:44,273 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:05:44,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:05:44,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:44,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:05:44,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:05:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-02 14:05:44,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:05:44,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:05:44,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:05:44,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:05:44,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:05:44,464 INFO L87 Difference]: Start difference. First operand 201692 states and 311050 transitions. Second operand 3 states. [2019-10-02 14:05:59,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:05:59,797 INFO L93 Difference]: Finished difference Result 430187 states and 669819 transitions. [2019-10-02 14:05:59,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:05:59,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 344 [2019-10-02 14:05:59,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:00,563 INFO L225 Difference]: With dead ends: 430187 [2019-10-02 14:06:00,564 INFO L226 Difference]: Without dead ends: 228584 [2019-10-02 14:06:00,955 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:06:01,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228584 states. [2019-10-02 14:06:10,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228584 to 228572. [2019-10-02 14:06:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228572 states. [2019-10-02 14:06:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228572 states to 228572 states and 358090 transitions. [2019-10-02 14:06:11,406 INFO L78 Accepts]: Start accepts. Automaton has 228572 states and 358090 transitions. Word has length 344 [2019-10-02 14:06:11,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:06:11,406 INFO L475 AbstractCegarLoop]: Abstraction has 228572 states and 358090 transitions. [2019-10-02 14:06:11,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:06:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 228572 states and 358090 transitions. [2019-10-02 14:06:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-10-02 14:06:11,685 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:06:11,685 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:06:11,685 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:06:11,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:06:11,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1062822394, now seen corresponding path program 1 times [2019-10-02 14:06:11,686 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:06:11,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:06:11,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:11,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:11,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:12,888 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-02 14:06:12,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:06:12,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 14:06:12,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:06:12,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:06:12,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:06:12,890 INFO L87 Difference]: Start difference. First operand 228572 states and 358090 transitions. Second operand 7 states. [2019-10-02 14:06:25,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:06:25,551 INFO L93 Difference]: Finished difference Result 457163 states and 718575 transitions. [2019-10-02 14:06:25,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:06:25,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 345 [2019-10-02 14:06:25,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:27,163 INFO L225 Difference]: With dead ends: 457163 [2019-10-02 14:06:27,163 INFO L226 Difference]: Without dead ends: 228680 [2019-10-02 14:06:27,545 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:06:27,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228680 states. [2019-10-02 14:06:43,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228680 to 228680. [2019-10-02 14:06:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228680 states. [2019-10-02 14:06:44,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228680 states to 228680 states and 358222 transitions. [2019-10-02 14:06:44,534 INFO L78 Accepts]: Start accepts. Automaton has 228680 states and 358222 transitions. Word has length 345 [2019-10-02 14:06:44,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:06:44,534 INFO L475 AbstractCegarLoop]: Abstraction has 228680 states and 358222 transitions. [2019-10-02 14:06:44,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:06:44,535 INFO L276 IsEmpty]: Start isEmpty. Operand 228680 states and 358222 transitions. [2019-10-02 14:06:44,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-10-02 14:06:44,792 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:06:44,792 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:06:44,792 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:06:44,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:06:44,792 INFO L82 PathProgramCache]: Analyzing trace with hash -905043353, now seen corresponding path program 1 times [2019-10-02 14:06:44,793 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:06:44,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:06:44,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:44,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:44,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:44,970 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-02 14:06:44,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:06:44,970 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:06:45,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:45,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 3716 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:06:45,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:06:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-02 14:06:46,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:06:46,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-10-02 14:06:46,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:06:46,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:06:46,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:06:46,814 INFO L87 Difference]: Start difference. First operand 228680 states and 358222 transitions. Second operand 9 states. [2019-10-02 14:07:01,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:07:01,825 INFO L93 Difference]: Finished difference Result 395460 states and 609321 transitions. [2019-10-02 14:07:01,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:07:01,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 346 [2019-10-02 14:07:01,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:07:02,634 INFO L225 Difference]: With dead ends: 395460 [2019-10-02 14:07:02,634 INFO L226 Difference]: Without dead ends: 227892 [2019-10-02 14:07:03,617 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:07:03,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227892 states. [2019-10-02 14:07:12,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227892 to 227873. [2019-10-02 14:07:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227873 states. [2019-10-02 14:07:14,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227873 states to 227873 states and 354107 transitions. [2019-10-02 14:07:14,037 INFO L78 Accepts]: Start accepts. Automaton has 227873 states and 354107 transitions. Word has length 346 [2019-10-02 14:07:14,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:07:14,037 INFO L475 AbstractCegarLoop]: Abstraction has 227873 states and 354107 transitions. [2019-10-02 14:07:14,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:07:14,038 INFO L276 IsEmpty]: Start isEmpty. Operand 227873 states and 354107 transitions. [2019-10-02 14:07:14,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-10-02 14:07:14,304 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:07:14,304 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:07:14,304 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:07:14,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:07:14,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1161349092, now seen corresponding path program 1 times [2019-10-02 14:07:14,305 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:07:14,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:07:14,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:07:14,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:07:14,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:07:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:07:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-02 14:07:14,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:07:14,527 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:07:14,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:07:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:07:15,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 3781 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:07:15,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:07:15,432 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-10-02 14:07:16,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:07:16,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-10-02 14:07:16,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:07:16,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:07:16,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:07:16,494 INFO L87 Difference]: Start difference. First operand 227873 states and 354107 transitions. Second operand 12 states. [2019-10-02 14:07:30,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:07:30,777 INFO L93 Difference]: Finished difference Result 399987 states and 610073 transitions. [2019-10-02 14:07:30,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:07:30,778 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 364 [2019-10-02 14:07:30,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:07:31,573 INFO L225 Difference]: With dead ends: 399987 [2019-10-02 14:07:31,573 INFO L226 Difference]: Without dead ends: 230282 [2019-10-02 14:07:32,497 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-10-02 14:07:32,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230282 states. [2019-10-02 14:07:48,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230282 to 228960. [2019-10-02 14:07:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228960 states. [2019-10-02 14:07:49,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228960 states to 228960 states and 355651 transitions. [2019-10-02 14:07:49,232 INFO L78 Accepts]: Start accepts. Automaton has 228960 states and 355651 transitions. Word has length 364 [2019-10-02 14:07:49,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:07:49,233 INFO L475 AbstractCegarLoop]: Abstraction has 228960 states and 355651 transitions. [2019-10-02 14:07:49,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:07:49,233 INFO L276 IsEmpty]: Start isEmpty. Operand 228960 states and 355651 transitions. [2019-10-02 14:07:49,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-10-02 14:07:49,510 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:07:49,511 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:07:49,511 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:07:49,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:07:49,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1420963115, now seen corresponding path program 1 times [2019-10-02 14:07:49,511 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:07:49,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:07:49,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:07:49,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:07:49,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:07:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:07:49,685 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-02 14:07:49,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:07:49,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:07:49,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:07:49,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:07:49,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:07:49,688 INFO L87 Difference]: Start difference. First operand 228960 states and 355651 transitions. Second operand 3 states. [2019-10-02 14:08:06,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:08:06,944 INFO L93 Difference]: Finished difference Result 508605 states and 800427 transitions. [2019-10-02 14:08:06,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:08:06,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-10-02 14:08:06,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:08:07,860 INFO L225 Difference]: With dead ends: 508605 [2019-10-02 14:08:07,861 INFO L226 Difference]: Without dead ends: 280541 [2019-10-02 14:08:08,233 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:08:08,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280541 states. [2019-10-02 14:08:20,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280541 to 280529. [2019-10-02 14:08:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280529 states. [2019-10-02 14:08:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280529 states to 280529 states and 444497 transitions. [2019-10-02 14:08:22,887 INFO L78 Accepts]: Start accepts. Automaton has 280529 states and 444497 transitions. Word has length 331 [2019-10-02 14:08:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:08:22,888 INFO L475 AbstractCegarLoop]: Abstraction has 280529 states and 444497 transitions. [2019-10-02 14:08:22,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:08:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand 280529 states and 444497 transitions. [2019-10-02 14:08:23,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-10-02 14:08:23,387 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:08:23,387 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-02 14:08:23,387 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:08:23,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:08:23,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2039235443, now seen corresponding path program 1 times [2019-10-02 14:08:23,388 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:08:23,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:08:23,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:23,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:23,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:23,545 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-02 14:08:23,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:08:23,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:08:23,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:08:23,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:08:23,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:08:23,547 INFO L87 Difference]: Start difference. First operand 280529 states and 444497 transitions. Second operand 3 states. [2019-10-02 14:08:43,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:08:43,362 INFO L93 Difference]: Finished difference Result 658545 states and 1056753 transitions. [2019-10-02 14:08:43,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:08:43,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-10-02 14:08:43,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:08:44,681 INFO L225 Difference]: With dead ends: 658545 [2019-10-02 14:08:44,682 INFO L226 Difference]: Without dead ends: 379061 [2019-10-02 14:08:53,895 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:08:54,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379061 states. [2019-10-02 14:09:12,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379061 to 379049. [2019-10-02 14:09:12,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379049 states. [2019-10-02 14:09:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379049 states to 379049 states and 610666 transitions. [2019-10-02 14:09:14,682 INFO L78 Accepts]: Start accepts. Automaton has 379049 states and 610666 transitions. Word has length 332 [2019-10-02 14:09:14,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:09:14,683 INFO L475 AbstractCegarLoop]: Abstraction has 379049 states and 610666 transitions. [2019-10-02 14:09:14,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:09:14,683 INFO L276 IsEmpty]: Start isEmpty. Operand 379049 states and 610666 transitions. [2019-10-02 14:09:15,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-10-02 14:09:15,670 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:09:15,670 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:09:15,671 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:09:15,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:09:15,671 INFO L82 PathProgramCache]: Analyzing trace with hash 656027509, now seen corresponding path program 1 times [2019-10-02 14:09:15,671 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:09:15,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:09:15,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:15,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:09:15,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:09:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-02 14:09:15,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:09:15,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:09:15,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:09:15,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:09:15,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:09:15,818 INFO L87 Difference]: Start difference. First operand 379049 states and 610666 transitions. Second operand 3 states. [2019-10-02 14:09:45,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:09:45,784 INFO L93 Difference]: Finished difference Result 944287 states and 1542139 transitions. [2019-10-02 14:09:45,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:09:45,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-10-02 14:09:45,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:09:58,928 INFO L225 Difference]: With dead ends: 944287 [2019-10-02 14:09:58,928 INFO L226 Difference]: Without dead ends: 566557 [2019-10-02 14:09:59,616 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:09:59,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566557 states.